./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc --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 b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:35:45,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:35:45,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:35:45,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:35:45,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:35:45,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:35:45,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:35:45,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:35:45,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:35:45,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:35:45,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:35:45,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:35:45,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:35:45,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:35:45,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:35:45,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:35:45,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:35:45,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:35:45,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:35:45,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:35:45,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:35:45,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:35:45,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:35:45,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:35:45,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:35:45,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:35:45,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:35:45,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:35:45,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:35:45,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:35:45,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:35:45,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:35:45,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:35:45,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:35:45,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:35:45,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:35:45,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:35:45,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:35:45,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:35:45,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:35:45,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:35:45,903 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:35:45,952 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:35:45,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:35:45,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:35:45,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:35:45,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:35:45,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:35:45,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:35:45,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:35:45,956 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:35:45,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:35:45,957 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:35:45,957 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:35:45,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:35:45,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:35:45,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:35:45,958 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:35:45,958 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:35:45,959 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:35:45,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:35:45,959 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:35:45,959 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:35:45,959 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:35:45,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:35:45,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:35:45,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:35:45,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:35:45,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:35:45,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:35:45,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:35:45,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:35:45,963 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_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/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_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc 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 -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2022-11-02 20:35:46,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:35:46,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:35:46,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:35:46,347 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:35:46,348 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:35:46,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-11-02 20:35:46,434 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/data/f749bf79c/f5ad0fbcb8ed4ee0ac2b9eaa662de8df/FLAG009ae8809 [2022-11-02 20:35:47,052 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:35:47,053 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-11-02 20:35:47,077 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/data/f749bf79c/f5ad0fbcb8ed4ee0ac2b9eaa662de8df/FLAG009ae8809 [2022-11-02 20:35:47,266 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/data/f749bf79c/f5ad0fbcb8ed4ee0ac2b9eaa662de8df [2022-11-02 20:35:47,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:35:47,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:35:47,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:35:47,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:35:47,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:35:47,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:47,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd14303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47, skipping insertion in model container [2022-11-02 20:35:47,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:47,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:35:47,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:35:47,739 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_e1b44f92-cd20-408e-8f8c-e22e2362c70a/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2022-11-02 20:35:47,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:35:47,757 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:35:47,851 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_e1b44f92-cd20-408e-8f8c-e22e2362c70a/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2022-11-02 20:35:47,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:35:47,890 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:35:47,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47 WrapperNode [2022-11-02 20:35:47,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:35:47,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:35:47,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:35:47,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:35:47,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:47,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:47,990 INFO L138 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-11-02 20:35:47,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:35:47,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:35:47,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:35:47,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:35:48,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:48,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:48,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:48,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:48,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:48,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:48,024 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:48,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:48,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:35:48,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:35:48,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:35:48,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:35:48,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (1/1) ... [2022-11-02 20:35:48,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:35:48,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:48,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:48,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:35:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 20:35:48,149 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 20:35:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:35:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:35:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:35:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:35:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:35:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:35:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:35:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:35:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:35:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:35:48,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:35:48,365 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:35:48,367 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:35:48,413 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 20:35:48,705 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:35:48,712 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:35:48,712 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:35:48,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:48 BoogieIcfgContainer [2022-11-02 20:35:48,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:35:48,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:35:48,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:35:48,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:35:48,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:35:47" (1/3) ... [2022-11-02 20:35:48,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdb3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:35:48, skipping insertion in model container [2022-11-02 20:35:48,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:47" (2/3) ... [2022-11-02 20:35:48,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdb3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:35:48, skipping insertion in model container [2022-11-02 20:35:48,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:48" (3/3) ... [2022-11-02 20:35:48,725 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2022-11-02 20:35:48,747 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:35:48,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-11-02 20:35:48,802 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:35:48,831 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@769cb36b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:35:48,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-02 20:35:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 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) [2022-11-02 20:35:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:35:48,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:48,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:35:48,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:48,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-11-02 20:35:48,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:48,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753738863] [2022-11-02 20:35:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:48,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:49,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753738863] [2022-11-02 20:35:49,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753738863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:49,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:49,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907293895] [2022-11-02 20:35:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:49,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:49,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:49,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:49,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:49,239 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 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) [2022-11-02 20:35:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:49,434 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-11-02 20:35:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:49,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:35:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:49,450 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:35:49,450 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:35:49,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:49,457 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:49,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 93 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:35:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:35:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 51. [2022-11-02 20:35:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 50 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) [2022-11-02 20:35:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-11-02 20:35:49,510 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 5 [2022-11-02 20:35:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:49,511 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-11-02 20:35:49,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-11-02 20:35:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:35:49,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:49,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:35:49,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:35:49,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-11-02 20:35:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:49,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724300048] [2022-11-02 20:35:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:49,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:49,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724300048] [2022-11-02 20:35:49,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724300048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:49,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:49,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:49,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722509818] [2022-11-02 20:35:49,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:49,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:49,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:49,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:49,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:49,729 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:49,818 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2022-11-02 20:35:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:49,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:35:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:49,820 INFO L225 Difference]: With dead ends: 85 [2022-11-02 20:35:49,820 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:35:49,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:49,823 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:49,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:35:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:35:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2022-11-02 20:35:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-11-02 20:35:49,831 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 5 [2022-11-02 20:35:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:49,832 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-11-02 20:35:49,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-11-02 20:35:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:35:49,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:49,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:49,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:35:49,834 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:49,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113076, now seen corresponding path program 1 times [2022-11-02 20:35:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:49,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921013639] [2022-11-02 20:35:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:49,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921013639] [2022-11-02 20:35:49,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921013639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:49,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:49,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:35:49,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49541261] [2022-11-02 20:35:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:49,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:49,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:49,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:49,925 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:49,937 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-02 20:35:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:49,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-02 20:35:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:49,939 INFO L225 Difference]: With dead ends: 58 [2022-11-02 20:35:49,939 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 20:35:49,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:49,941 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:49,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:35:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 20:35:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2022-11-02 20:35:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-11-02 20:35:49,949 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 7 [2022-11-02 20:35:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:49,949 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-11-02 20:35:49,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-11-02 20:35:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:35:49,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:49,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:49,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:35:49,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-11-02 20:35:49,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:49,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464473711] [2022-11-02 20:35:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:50,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:50,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464473711] [2022-11-02 20:35:50,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464473711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:50,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:50,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:35:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410543459] [2022-11-02 20:35:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:50,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:50,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:50,026 INFO L87 Difference]: Start difference. First operand 49 states and 52 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) [2022-11-02 20:35:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:50,047 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-11-02 20:35:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:50,048 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 [2022-11-02 20:35:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:50,049 INFO L225 Difference]: With dead ends: 55 [2022-11-02 20:35:50,050 INFO L226 Difference]: Without dead ends: 55 [2022-11-02 20:35:50,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:50,051 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:50,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:35:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-02 20:35:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-11-02 20:35:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-02 20:35:50,058 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 9 [2022-11-02 20:35:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:50,058 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-02 20:35:50,058 INFO L496 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) [2022-11-02 20:35:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-02 20:35:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:35:50,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:50,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:50,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:35:50,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash -763066877, now seen corresponding path program 1 times [2022-11-02 20:35:50,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:50,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095888615] [2022-11-02 20:35:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:50,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095888615] [2022-11-02 20:35:50,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095888615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:50,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044227887] [2022-11-02 20:35:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:50,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:50,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:50,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:50,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:35:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:50,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:35:50,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:50,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:35:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:50,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044227887] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:35:50,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:35:50,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 20:35:50,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772318070] [2022-11-02 20:35:50,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:35:50,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:35:50,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:50,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:35:50,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:35:50,570 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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) [2022-11-02 20:35:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:50,589 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-11-02 20:35:50,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:35:50,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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 14 [2022-11-02 20:35:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:50,591 INFO L225 Difference]: With dead ends: 56 [2022-11-02 20:35:50,591 INFO L226 Difference]: Without dead ends: 56 [2022-11-02 20:35:50,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:35:50,593 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 134 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 [2022-11-02 20:35:50,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:35:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-02 20:35:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-02 20:35:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-11-02 20:35:50,599 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 14 [2022-11-02 20:35:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:50,600 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-11-02 20:35:50,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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) [2022-11-02 20:35:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-11-02 20:35:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:35:50,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:50,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:50,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:50,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:50,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-11-02 20:35:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:50,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284195248] [2022-11-02 20:35:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:51,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:51,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284195248] [2022-11-02 20:35:51,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284195248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:51,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691627499] [2022-11-02 20:35:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:51,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:51,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:51,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:51,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:35:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:51,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:35:51,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:51,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:35:51,249 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:35:51,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:35:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:51,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:35:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:51,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691627499] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:35:51,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:35:51,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-02 20:35:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813560692] [2022-11-02 20:35:51,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:35:51,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:35:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:35:51,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:35:51,485 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:51,628 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-11-02 20:35:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:35:51,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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 16 [2022-11-02 20:35:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:51,633 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:35:51,634 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:35:51,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:35:51,641 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 76 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:51,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 123 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2022-11-02 20:35:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:35:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2022-11-02 20:35:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-11-02 20:35:51,660 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 16 [2022-11-02 20:35:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:51,661 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-11-02 20:35:51,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-11-02 20:35:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:35:51,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:51,664 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:51,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:51,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:35:51,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:51,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-11-02 20:35:51,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:51,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957444568] [2022-11-02 20:35:51,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:51,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:52,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:52,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957444568] [2022-11-02 20:35:52,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957444568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:52,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733077523] [2022-11-02 20:35:52,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:52,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:52,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:52,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:52,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:35:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:52,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:35:52,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:52,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:35:52,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:52,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:35:52,533 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:35:52,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:35:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:52,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:35:52,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-11-02 20:35:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:53,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733077523] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:35:53,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:35:53,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-02 20:35:53,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593914609] [2022-11-02 20:35:53,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:35:53,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:35:53,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:53,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:35:53,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:35:53,006 INFO L87 Difference]: Start difference. First operand 55 states and 58 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) [2022-11-02 20:35:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:53,212 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-11-02 20:35:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:35:53,214 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 [2022-11-02 20:35:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:53,215 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:35:53,216 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:35:53,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:35:53,219 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 323 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:53,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 60 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 58 Unchecked, 0.2s Time] [2022-11-02 20:35:53,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:35:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2022-11-02 20:35:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-02 20:35:53,239 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 16 [2022-11-02 20:35:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:53,239 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-02 20:35:53,239 INFO L496 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) [2022-11-02 20:35:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-02 20:35:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:35:53,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:53,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:53,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:53,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:53,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:53,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957292, now seen corresponding path program 2 times [2022-11-02 20:35:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:53,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014650446] [2022-11-02 20:35:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:53,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:53,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014650446] [2022-11-02 20:35:53,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014650446] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:53,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320011092] [2022-11-02 20:35:53,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:35:53,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:53,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:53,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:35:53,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 20:35:53,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:35:53,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:35:53,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:35:53,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:35:53,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320011092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:53,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:35:53,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-02 20:35:53,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983076437] [2022-11-02 20:35:53,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:53,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:35:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:53,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:35:53,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:35:53,750 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:53,779 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-11-02 20:35:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:35:53,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 21 [2022-11-02 20:35:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:53,781 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:35:53,781 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:35:53,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:35:53,782 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 90 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:53,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 91 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:35:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:35:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2022-11-02 20:35:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-11-02 20:35:53,801 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 21 [2022-11-02 20:35:53,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:53,801 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-11-02 20:35:53,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-11-02 20:35:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:35:53,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:53,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:53,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:54,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:54,023 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2022-11-02 20:35:54,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:54,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471324076] [2022-11-02 20:35:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:54,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:54,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471324076] [2022-11-02 20:35:54,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471324076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894977282] [2022-11-02 20:35:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:54,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:54,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:54,133 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:54,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:35:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:35:54,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:54,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:35:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:54,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894977282] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:35:54,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:35:54,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-02 20:35:54,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790219919] [2022-11-02 20:35:54,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:35:54,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:35:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:54,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:35:54,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:35:54,338 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) [2022-11-02 20:35:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:54,381 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-11-02 20:35:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:35:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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 21 [2022-11-02 20:35:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:54,383 INFO L225 Difference]: With dead ends: 55 [2022-11-02 20:35:54,383 INFO L226 Difference]: Without dead ends: 55 [2022-11-02 20:35:54,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:35:54,386 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 81 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:54,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:35:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-02 20:35:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-02 20:35:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-02 20:35:54,395 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 21 [2022-11-02 20:35:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:54,396 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-02 20:35:54,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) [2022-11-02 20:35:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-02 20:35:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:35:54,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:54,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:54,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:54,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:54,627 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:54,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2022-11-02 20:35:54,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:54,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300242617] [2022-11-02 20:35:54,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:35:54,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:54,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300242617] [2022-11-02 20:35:54,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300242617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:54,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495810517] [2022-11-02 20:35:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:54,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:54,968 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:54,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:35:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:55,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:35:55,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:55,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:35:55,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:55,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:35:55,194 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:35:55,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:35:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:35:55,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:35:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:35:55,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495810517] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:35:55,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:35:55,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-11-02 20:35:55,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714473297] [2022-11-02 20:35:55,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:35:55,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:35:55,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:55,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:35:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:35:55,340 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:55,482 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-11-02 20:35:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:35:55,482 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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 [2022-11-02 20:35:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:55,483 INFO L225 Difference]: With dead ends: 72 [2022-11-02 20:35:55,483 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:35:55,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:35:55,484 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 99 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:55,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 92 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-11-02 20:35:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:35:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2022-11-02 20:35:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-11-02 20:35:55,488 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 22 [2022-11-02 20:35:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:55,488 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-11-02 20:35:55,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-11-02 20:35:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:35:55,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:55,489 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:55,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:55,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:35:55,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:55,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2022-11-02 20:35:55,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:55,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468538612] [2022-11-02 20:35:55,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:55,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:56,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:56,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468538612] [2022-11-02 20:35:56,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468538612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:56,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211321983] [2022-11-02 20:35:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:56,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:56,067 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:56,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:35:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:56,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:35:56,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:56,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:35:56,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:56,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:35:56,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:56,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:35:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:35:56,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:35:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:35:58,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211321983] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:35:58,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:35:58,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-11-02 20:35:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154771272] [2022-11-02 20:35:58,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:35:58,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:35:58,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:58,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:35:58,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:35:58,922 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:59,151 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-11-02 20:35:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:35:59,152 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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 [2022-11-02 20:35:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:59,153 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:35:59,153 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:35:59,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:35:59,154 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 130 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:59,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 115 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-11-02 20:35:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:35:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2022-11-02 20:35:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-11-02 20:35:59,157 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 22 [2022-11-02 20:35:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:59,158 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-11-02 20:35:59,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-11-02 20:35:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:35:59,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:59,165 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:59,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-02 20:35:59,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:59,375 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:59,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:59,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2022-11-02 20:35:59,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:59,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888230815] [2022-11-02 20:35:59,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:35:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:59,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888230815] [2022-11-02 20:35:59,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888230815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:59,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:59,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:35:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387998716] [2022-11-02 20:35:59,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:59,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:35:59,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:59,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:35:59,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:35:59,570 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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) [2022-11-02 20:35:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:35:59,831 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-11-02 20:35:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:35:59,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 [2022-11-02 20:35:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:35:59,833 INFO L225 Difference]: With dead ends: 74 [2022-11-02 20:35:59,833 INFO L226 Difference]: Without dead ends: 74 [2022-11-02 20:35:59,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:35:59,834 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:35:59,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 131 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:35:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-02 20:35:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2022-11-02 20:35:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-02 20:35:59,837 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 23 [2022-11-02 20:35:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:59,837 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-02 20:35:59,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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) [2022-11-02 20:35:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-02 20:35:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:35:59,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:59,838 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:59,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:35:59,838 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:35:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:59,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2022-11-02 20:35:59,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:59,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068372695] [2022-11-02 20:35:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:59,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:36:00,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:00,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068372695] [2022-11-02 20:36:00,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068372695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:00,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:00,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:36:00,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58417494] [2022-11-02 20:36:00,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:00,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:36:00,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:00,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:36:00,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:36:00,237 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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) [2022-11-02 20:36:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:00,497 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-11-02 20:36:00,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:36:00,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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 [2022-11-02 20:36:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:00,498 INFO L225 Difference]: With dead ends: 68 [2022-11-02 20:36:00,498 INFO L226 Difference]: Without dead ends: 68 [2022-11-02 20:36:00,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:36:00,499 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 190 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:00,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 89 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:36:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-02 20:36:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2022-11-02 20:36:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.4) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-11-02 20:36:00,502 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 23 [2022-11-02 20:36:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:00,502 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-11-02 20:36:00,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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) [2022-11-02 20:36:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-11-02 20:36:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:36:00,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:00,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:00,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:36:00,503 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:00,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:00,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116430, now seen corresponding path program 1 times [2022-11-02 20:36:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:00,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380411374] [2022-11-02 20:36:00,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:00,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:01,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:01,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380411374] [2022-11-02 20:36:01,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380411374] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:01,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12042076] [2022-11-02 20:36:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:01,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:01,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:01,356 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:01,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:36:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:01,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-02 20:36:01,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:01,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:36:01,693 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:36:01,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:36:01,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:36:01,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:36:01,827 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:36:01,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-02 20:36:02,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-11-02 20:36:02,184 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-02 20:36:02,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2022-11-02 20:36:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:02,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:02,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-11-02 20:36:02,580 INFO L356 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-11-02 20:36:02,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-11-02 20:36:02,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)))))) is different from false [2022-11-02 20:36:02,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_810 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_810)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-02 20:36:02,649 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:02,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2022-11-02 20:36:02,706 INFO L356 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-11-02 20:36:02,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2022-11-02 20:36:02,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:02,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 104 [2022-11-02 20:36:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:36:02,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12042076] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:36:02,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:36:02,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2022-11-02 20:36:02,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072021725] [2022-11-02 20:36:02,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:02,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-02 20:36:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:02,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-02 20:36:02,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1027, Unknown=2, NotChecked=130, Total=1260 [2022-11-02 20:36:02,936 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:03,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (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| 4))) (let ((.cse0 (select .cse4 .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_810 Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_810)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select .cse2 .cse1) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1)))) is different from false [2022-11-02 20:36:03,180 WARN L833 $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_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse1 .cse2) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)))))))) is different from false [2022-11-02 20:36:03,186 WARN L833 $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_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse1 .cse2) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)))))))) is different from false [2022-11-02 20:36:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:04,468 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-11-02 20:36:04,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:36:04,469 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 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 26 [2022-11-02 20:36:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:04,470 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:36:04,470 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:36:04,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=236, Invalid=1585, Unknown=5, NotChecked=430, Total=2256 [2022-11-02 20:36:04,472 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 141 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:04,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 651 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 756 Invalid, 0 Unknown, 343 Unchecked, 0.6s Time] [2022-11-02 20:36:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:36:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 70. [2022-11-02 20:36:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-02 20:36:04,476 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 26 [2022-11-02 20:36:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:04,476 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-02 20:36:04,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-02 20:36:04,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:36:04,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:04,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:04,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:04,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:36:04,695 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116431, now seen corresponding path program 1 times [2022-11-02 20:36:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:04,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654160170] [2022-11-02 20:36:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:04,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:05,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:05,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654160170] [2022-11-02 20:36:05,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654160170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:05,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146053681] [2022-11-02 20:36:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:05,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:05,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:05,975 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:06,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:36:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 20:36:06,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:06,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:36:06,386 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:36:06,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:36:06,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:36:06,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:36:06,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:36:06,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:36:06,723 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:36:06,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2022-11-02 20:36:06,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-11-02 20:36:07,472 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-02 20:36:07,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 74 [2022-11-02 20:36:07,514 INFO L356 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-11-02 20:36:07,515 INFO L390 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 45 [2022-11-02 20:36:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:07,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:09,010 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:09,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 329 [2022-11-02 20:36:10,386 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse5 (select (select .cse3 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse1 (select (select .cse0 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse5 4))) (or (= (select (select .cse0 .cse1) .cse2) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (< (select (select .cse3 .cse1) .cse2) .cse4))))) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse7 (select (select .cse8 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse8 .cse7) (+ .cse9 4)))) (or (= .cse6 0) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7))))))) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse10 (select (select .cse10 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse12 (select (select .cse17 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse13 (select (select .cse15 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (+ 4 .cse12))) (let ((.cse11 (select (select .cse17 .cse13) .cse16))) (or (< .cse11 .cse4) (= .cse11 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse12)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13)) (= (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse14 (select (select .cse14 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse15 .cse13) .cse16)))))))) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse22 (select (select .cse21 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse19 (select (select .cse18 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (+ .cse22 4))) (or (= (select (select .cse18 .cse19) .cse20) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse19)) (< (select (select .cse21 .cse19) .cse20) .cse4) (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse23 (select (select .cse23 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2)) (.cse27 (select (select .cse24 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (+ 4 .cse27)) (.cse25 (select (select .cse28 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse24 .cse25) .cse26) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (= (select (select .cse28 .cse25) .cse26) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse25)))))))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse30 (select (select .cse33 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (select (select .cse33 .cse30) (+ .cse31 4)))) (or (= .cse29 0) (= .cse29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse30)) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse29 (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse32 (select (select .cse32 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse39 (select (select .cse34 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse35 (select (select .cse40 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (+ 4 .cse39))) (let ((.cse38 (select (select .cse40 .cse35) .cse36))) (or (= (select (select .cse34 .cse35) .cse36) 0) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse37 (select (select .cse37 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse38)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse39)) (= .cse38 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse35)))))))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse43 (select (select .cse41 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse41 .cse42) (+ .cse43 4)) 8)) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse42 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (select (select .cse47 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse44 (select (select .cse47 .cse46) (+ 4 .cse45)))) (or (< .cse44 .cse4) (= .cse44 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse45)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse46))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse48 (select (let ((.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse53 (select (select .cse53 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse48 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse50 (select (select .cse51 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse49 (select (select .cse51 .cse50) (+ .cse52 4)))) (or (= .cse49 0) (= .cse49 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse50)) (= .cse49 .cse48)))))) (not (= .cse52 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse58 (select (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse61 (select (select .cse61 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse60 (select (select .cse56 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse55 (select (select .cse59 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (+ .cse60 4))) (let ((.cse54 (select (select .cse59 .cse55) .cse57))) (or (= .cse54 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse55)) (< (select (select .cse56 .cse55) .cse57) .cse4) (= .cse54 .cse58)))))) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse67 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse64 (select (select .cse63 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse65 (+ 4 .cse67))) (let ((.cse62 (select (select .cse66 .cse64) .cse65))) (or (< .cse62 .cse4) (= .cse62 0) (= (select (select .cse63 .cse64) .cse65) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse64))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse67)))))))) is different from false [2022-11-02 20:36:13,352 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse70 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.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|) .cse70 0))) (.cse7 (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|) .cse70 0)))) (and (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse8 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse1 (select (select .cse3 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse8 4))) (let ((.cse0 (select (select .cse9 .cse1) .cse4))) (or (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse0 .cse2) (= (select (select .cse3 .cse1) .cse4) (select (let ((.cse5 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse5 (select (select .cse5 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse10 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse10 (select (select .cse10 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse15 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse12 (select (select .cse14 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse15 4))) (or (= (select (select .cse11 .cse12) .cse13) 0) (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse14 .cse12) .cse13) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse18 (select (let ((.cse21 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse21 (select (select .cse21 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse20 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse19 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse17 (select (select .cse19 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select .cse19 .cse17) (+ .cse20 4)))) (or (= .cse16 0) (= .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse18 .cse16)))))) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (= .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse26 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse24 (select (select .cse26 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (select (select .cse26 .cse24) (+ .cse23 4)))) (or (= .cse22 0) (= .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (let ((.cse25 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse25 (select (select .cse25 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse22)))))) (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse30 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse31 (select (select .cse30 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse27 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse29 (+ .cse31 4)) (.cse28 (select (select .cse27 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse27 .cse28) .cse29) 0) (< (select (select .cse30 .cse28) .cse29) .cse2) (not (= .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse32 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse35 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse34 (select (select .cse35 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse33 (select (select .cse35 .cse34) (+ .cse32 4)))) (or (= .cse33 0) (= .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse34 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse36 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse36 (select (select .cse36 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse40 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse37 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5)) (.cse41 (select (select .cse40 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse39 (+ .cse41 4)) (.cse38 (select (select .cse37 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse37 .cse38) .cse39) 0) (< (select (select .cse40 .cse38) .cse39) .cse2) (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse46 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse47 (select (select .cse46 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse44 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse43 (select (select .cse44 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (+ .cse47 4))) (let ((.cse42 (select (select .cse46 .cse43) .cse45))) (or (= .cse42 0) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse42 .cse2) (= (select (select .cse44 .cse43) .cse45) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse48 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse50 (select (select .cse48 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse48 .cse49) (+ .cse50 4)) 8)) (not (= .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse51 (select (let ((.cse58 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse58 (select (select .cse58 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse51 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse53 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse57 (select (select .cse53 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse56 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse54 (select (select .cse56 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse55 (+ .cse57 4))) (let ((.cse52 (select (select .cse56 .cse54) .cse55))) (or (= .cse52 0) (< (select (select .cse53 .cse54) .cse55) .cse2) (not (= .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse51 .cse52)))))) (not (= .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse59 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse64 (select (select .cse59 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse65 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse60 (select (select .cse65 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse61 (+ .cse64 4))) (let ((.cse62 (select (select .cse65 .cse60) .cse61))) (or (= (select (select .cse59 .cse60) .cse61) 0) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse62 (select (let ((.cse63 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse63 (select (select .cse63 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= .cse62 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse64 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse69 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse67 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (select (select .cse69 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse66 (select (select .cse69 .cse67) (+ .cse68 4)))) (or (= .cse66 0) (not (= .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse66 .cse2) (not (= .cse68 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))))) is different from false [2022-11-02 20:36:13,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:13,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 131 [2022-11-02 20:36:14,237 INFO L356 Elim1Store]: treesize reduction 232, result has 36.8 percent of original size [2022-11-02 20:36:14,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 533 treesize of output 547 [2022-11-02 20:36:14,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:14,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 401 treesize of output 260 [2022-11-02 20:36:14,780 INFO L356 Elim1Store]: treesize reduction 200, result has 43.2 percent of original size [2022-11-02 20:36:14,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 1547 treesize of output 1496 [2022-11-02 20:36:15,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:15,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1215 treesize of output 1131 [2022-11-02 20:36:15,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:15,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1318 treesize of output 1194 [2022-11-02 20:36:15,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:15,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 473 treesize of output 467 [2022-11-02 20:36:23,135 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 20:36:23,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 1 [2022-11-02 20:36:23,153 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:23,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2022-11-02 20:36:23,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:23,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 60 [2022-11-02 20:36:23,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:36:23,406 INFO L356 Elim1Store]: treesize reduction 127, result has 43.6 percent of original size [2022-11-02 20:36:23,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 196 treesize of output 229 [2022-11-02 20:36:23,579 INFO L356 Elim1Store]: treesize reduction 4, result has 96.1 percent of original size [2022-11-02 20:36:23,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 155 [2022-11-02 20:36:23,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:36:23,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 137 [2022-11-02 20:36:25,892 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 20:36:25,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2022-11-02 20:36:25,911 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 20:36:25,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 465 treesize of output 1 [2022-11-02 20:36:25,927 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 20:36:25,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 1 [2022-11-02 20:36:25,947 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 20:36:25,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 1 [2022-11-02 20:36:25,964 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 20:36:25,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2022-11-02 20:36:25,980 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 20:36:25,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 381 treesize of output 1 [2022-11-02 20:36:25,996 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 20:36:25,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 379 treesize of output 1 [2022-11-02 20:36:26,010 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 20:36:26,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 1 [2022-11-02 20:36:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:36:26,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146053681] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:36:26,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:36:26,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 42 [2022-11-02 20:36:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870704076] [2022-11-02 20:36:26,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:26,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:36:26,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:26,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:36:26,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1521, Unknown=2, NotChecked=158, Total=1806 [2022-11-02 20:36:26,287 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:26,892 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse49 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse73 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse48 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse74 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse48 .cse74 0))) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse73 .cse74 0))) (.cse50 (select .cse73 .cse49))) (and (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse8 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse1 (select (select .cse3 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse8 4))) (let ((.cse0 (select (select .cse9 .cse1) .cse4))) (or (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse0 .cse2) (= (select (select .cse3 .cse1) .cse4) (select (let ((.cse5 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse5 (select (select .cse5 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse10 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse10 (select (select .cse10 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse15 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse12 (select (select .cse14 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse15 4))) (or (= (select (select .cse11 .cse12) .cse13) 0) (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse14 .cse12) .cse13) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse18 (select (let ((.cse21 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse21 (select (select .cse21 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse20 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse19 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse17 (select (select .cse19 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select .cse19 .cse17) (+ .cse20 4)))) (or (= .cse16 0) (= .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse18 .cse16)))))) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (= .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse26 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse24 (select (select .cse26 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (select (select .cse26 .cse24) (+ .cse23 4)))) (or (= .cse22 0) (= .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (let ((.cse25 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse25 (select (select .cse25 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse22)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse30 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse31 (select (select .cse30 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse27 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse29 (+ .cse31 4)) (.cse28 (select (select .cse27 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse27 .cse28) .cse29) 0) (< (select (select .cse30 .cse28) .cse29) .cse2) (not (= .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse32 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse35 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse34 (select (select .cse35 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse33 (select (select .cse35 .cse34) (+ .cse32 4)))) (or (= .cse33 0) (= .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse34 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse36 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse36 (select (select .cse36 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse40 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse37 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5)) (.cse41 (select (select .cse40 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse39 (+ .cse41 4)) (.cse38 (select (select .cse37 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse37 .cse38) .cse39) 0) (< (select (select .cse40 .cse38) .cse39) .cse2) (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse46 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse47 (select (select .cse46 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse44 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse43 (select (select .cse44 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (+ .cse47 4))) (let ((.cse42 (select (select .cse46 .cse43) .cse45))) (or (= .cse42 0) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse42 .cse2) (= (select (select .cse44 .cse43) .cse45) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= (select .cse48 .cse49) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse50 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) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse51 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse53 (select (select .cse51 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse51 .cse52) (+ .cse53 4)) 8)) (not (= .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse52 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse54 (select (let ((.cse61 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse61 (select (select .cse61 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse54 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse56 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse60 (select (select .cse56 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse59 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse57 (select (select .cse59 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse58 (+ .cse60 4))) (let ((.cse55 (select (select .cse59 .cse57) .cse58))) (or (= .cse55 0) (< (select (select .cse56 .cse57) .cse58) .cse2) (not (= .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse54 .cse55)))))) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse62 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse67 (select (select .cse62 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse63 (select (select .cse68 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (+ .cse67 4))) (let ((.cse65 (select (select .cse68 .cse63) .cse64))) (or (= (select (select .cse62 .cse63) .cse64) 0) (not (= .cse63 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse65 (select (let ((.cse66 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse66 (select (select .cse66 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse72 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse70 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse71 (select (select .cse72 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse69 (select (select .cse72 .cse70) (+ .cse71 4)))) (or (= .cse69 0) (not (= .cse70 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse69 .cse2) (not (= .cse71 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse50) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-11-02 20:36:26,956 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse58 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse45 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse44 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse47 (select .cse58 .cse45)) (.cse46 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse5 (select (select .cse3 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse1 (select (select .cse0 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse5 4))) (or (= (select (select .cse0 .cse1) .cse2) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (< (select (select .cse3 .cse1) .cse2) .cse4))))) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse7 (select (select .cse8 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse8 .cse7) (+ .cse9 4)))) (or (= .cse6 0) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7))))))) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse10 (select (select .cse10 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse12 (select (select .cse17 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse13 (select (select .cse15 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (+ 4 .cse12))) (let ((.cse11 (select (select .cse17 .cse13) .cse16))) (or (< .cse11 .cse4) (= .cse11 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse12)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13)) (= (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse14 (select (select .cse14 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse15 .cse13) .cse16)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse22 (select (select .cse21 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse19 (select (select .cse18 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (+ .cse22 4))) (or (= (select (select .cse18 .cse19) .cse20) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse19)) (< (select (select .cse21 .cse19) .cse20) .cse4) (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse23 (select (select .cse23 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2)) (.cse27 (select (select .cse24 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (+ 4 .cse27)) (.cse25 (select (select .cse28 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse24 .cse25) .cse26) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (= (select (select .cse28 .cse25) .cse26) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse25)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse30 (select (select .cse33 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (select (select .cse33 .cse30) (+ .cse31 4)))) (or (= .cse29 0) (= .cse29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse30)) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse29 (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse32 (select (select .cse32 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse39 (select (select .cse34 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse35 (select (select .cse40 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (+ 4 .cse39))) (let ((.cse38 (select (select .cse40 .cse35) .cse36))) (or (= (select (select .cse34 .cse35) .cse36) 0) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse37 (select (select .cse37 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse38)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse39)) (= .cse38 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse35)))))))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse43 (select (select .cse41 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse41 .cse42) (+ .cse43 4)) 8)) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse42 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= (select .cse44 .cse45) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse44 .cse46) 0) (= .cse47 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) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse50 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (select (select .cse51 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse48 (select (select .cse51 .cse50) (+ 4 .cse49)))) (or (< .cse48 .cse4) (= .cse48 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse49)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse50))))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse47) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse52 (select (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse57 (select (select .cse57 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse52 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse56 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse54 (select (select .cse55 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse53 (select (select .cse55 .cse54) (+ .cse56 4)))) (or (= .cse53 0) (= .cse53 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse54)) (= .cse53 .cse52)))))) (not (= .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select .cse58 .cse46) 0) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse63 (select (let ((.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse66 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse61 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse65 (select (select .cse61 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse60 (select (select .cse64 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (+ .cse65 4))) (let ((.cse59 (select (select .cse64 .cse60) .cse62))) (or (= .cse59 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse60)) (< (select (select .cse61 .cse60) .cse62) .cse4) (= .cse59 .cse63)))))) (not (= .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= .cse63 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse72 (select (select .cse71 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse69 (select (select .cse68 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse70 (+ 4 .cse72))) (let ((.cse67 (select (select .cse71 .cse69) .cse70))) (or (< .cse67 .cse4) (= .cse67 0) (= (select (select .cse68 .cse69) .cse70) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse69))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse72))))))))) is different from false [2022-11-02 20:36:27,052 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse58 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse45 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse44 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse47 (select .cse58 .cse45)) (.cse46 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse5 (select (select .cse3 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse1 (select (select .cse0 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse5 4))) (or (= (select (select .cse0 .cse1) .cse2) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (< (select (select .cse3 .cse1) .cse2) .cse4))))) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse7 (select (select .cse8 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse8 .cse7) (+ .cse9 4)))) (or (= .cse6 0) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7))))))) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse10 (select (select .cse10 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse12 (select (select .cse17 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse13 (select (select .cse15 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (+ 4 .cse12))) (let ((.cse11 (select (select .cse17 .cse13) .cse16))) (or (< .cse11 .cse4) (= .cse11 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse12)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13)) (= (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse14 (select (select .cse14 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse15 .cse13) .cse16)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse22 (select (select .cse21 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse19 (select (select .cse18 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (+ .cse22 4))) (or (= (select (select .cse18 .cse19) .cse20) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse19)) (< (select (select .cse21 .cse19) .cse20) .cse4) (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse23 (select (select .cse23 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2)) (.cse27 (select (select .cse24 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (+ 4 .cse27)) (.cse25 (select (select .cse28 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse24 .cse25) .cse26) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (= (select (select .cse28 .cse25) .cse26) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse25)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse30 (select (select .cse33 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (select (select .cse33 .cse30) (+ .cse31 4)))) (or (= .cse29 0) (= .cse29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse30)) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse29 (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse32 (select (select .cse32 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse39 (select (select .cse34 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse35 (select (select .cse40 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (+ 4 .cse39))) (let ((.cse38 (select (select .cse40 .cse35) .cse36))) (or (= (select (select .cse34 .cse35) .cse36) 0) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse37 (select (select .cse37 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse38)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse39)) (= .cse38 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse35)))))))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse43 (select (select .cse41 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse41 .cse42) (+ .cse43 4)) 8)) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse42 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= (select .cse44 .cse45) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse44 .cse46) 0) (= .cse47 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse50 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (select (select .cse51 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse48 (select (select .cse51 .cse50) (+ 4 .cse49)))) (or (< .cse48 .cse4) (= .cse48 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse49)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse50))))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse47) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse52 (select (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse57 (select (select .cse57 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse52 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse56 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse54 (select (select .cse55 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse53 (select (select .cse55 .cse54) (+ .cse56 4)))) (or (= .cse53 0) (= .cse53 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse54)) (= .cse53 .cse52)))))) (not (= .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (= (select .cse58 .cse46) 0) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse63 (select (let ((.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse66 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse61 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse65 (select (select .cse61 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse60 (select (select .cse64 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (+ .cse65 4))) (let ((.cse59 (select (select .cse64 .cse60) .cse62))) (or (= .cse59 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse60)) (< (select (select .cse61 .cse60) .cse62) .cse4) (= .cse59 .cse63)))))) (not (= .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= .cse63 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse72 (select (select .cse71 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse69 (select (select .cse68 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse70 (+ 4 .cse72))) (let ((.cse67 (select (select .cse71 .cse69) .cse70))) (or (< .cse67 .cse4) (= .cse67 0) (= (select (select .cse68 .cse69) .cse70) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse69))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse72))))))))) is different from false [2022-11-02 20:36:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:30,393 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2022-11-02 20:36:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:36:30,393 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 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 26 [2022-11-02 20:36:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:30,394 INFO L225 Difference]: With dead ends: 180 [2022-11-02 20:36:30,395 INFO L226 Difference]: Without dead ends: 180 [2022-11-02 20:36:30,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=344, Invalid=3093, Unknown=5, NotChecked=590, Total=4032 [2022-11-02 20:36:30,397 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 298 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:30,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1233 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1185 Invalid, 0 Unknown, 507 Unchecked, 1.2s Time] [2022-11-02 20:36:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-02 20:36:30,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 70. [2022-11-02 20:36:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-11-02 20:36:30,402 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 26 [2022-11-02 20:36:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:30,402 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-11-02 20:36:30,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-11-02 20:36:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:36:30,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:30,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:30,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:30,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:36:30,623 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:30,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash 687445232, now seen corresponding path program 1 times [2022-11-02 20:36:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:30,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51865536] [2022-11-02 20:36:30,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:36:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:31,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51865536] [2022-11-02 20:36:31,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51865536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:31,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:31,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:36:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720695318] [2022-11-02 20:36:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:31,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:36:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:31,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:36:31,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:36:31,017 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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) [2022-11-02 20:36:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:31,254 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-02 20:36:31,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:36:31,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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 28 [2022-11-02 20:36:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:31,256 INFO L225 Difference]: With dead ends: 83 [2022-11-02 20:36:31,256 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 20:36:31,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:36:31,257 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 192 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:31,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 134 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:36:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 20:36:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2022-11-02 20:36:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-11-02 20:36:31,260 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 28 [2022-11-02 20:36:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:31,260 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-11-02 20:36:31,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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) [2022-11-02 20:36:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-11-02 20:36:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:36:31,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:31,261 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:36:31,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:36:31,262 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:31,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:31,262 INFO L85 PathProgramCache]: Analyzing trace with hash -164034179, now seen corresponding path program 1 times [2022-11-02 20:36:31,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:31,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142091581] [2022-11-02 20:36:31,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:36:31,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:31,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142091581] [2022-11-02 20:36:31,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142091581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:31,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:31,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:36:31,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041692030] [2022-11-02 20:36:31,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:31,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:36:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:36:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:36:31,916 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:32,281 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-11-02 20:36:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:36:32,282 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-02 20:36:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:32,282 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:36:32,282 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:36:32,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:36:32,283 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 192 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:32,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 94 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:36:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:36:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-11-02 20:36:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 75 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) [2022-11-02 20:36:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-11-02 20:36:32,287 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 29 [2022-11-02 20:36:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:32,287 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-11-02 20:36:32,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-11-02 20:36:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:36:32,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:32,288 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:36:32,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:36:32,289 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:32,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash -790092142, now seen corresponding path program 1 times [2022-11-02 20:36:32,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:32,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136014119] [2022-11-02 20:36:32,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:36:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:32,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136014119] [2022-11-02 20:36:32,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136014119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:32,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:32,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:36:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571078843] [2022-11-02 20:36:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:32,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:36:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:36:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:36:32,824 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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) [2022-11-02 20:36:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:33,325 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-02 20:36:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:36:33,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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 [2022-11-02 20:36:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:33,327 INFO L225 Difference]: With dead ends: 83 [2022-11-02 20:36:33,327 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 20:36:33,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:36:33,328 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 116 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:33,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 137 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:36:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 20:36:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-11-02 20:36:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 76 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) [2022-11-02 20:36:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-11-02 20:36:33,330 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 30 [2022-11-02 20:36:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:33,331 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-11-02 20:36:33,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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) [2022-11-02 20:36:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-11-02 20:36:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:36:33,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:33,332 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:36:33,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:36:33,332 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1276947488, now seen corresponding path program 1 times [2022-11-02 20:36:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:33,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49888993] [2022-11-02 20:36:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:36:33,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:33,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49888993] [2022-11-02 20:36:33,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49888993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:33,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:33,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:36:33,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820665008] [2022-11-02 20:36:33,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:33,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:36:33,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:33,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:36:33,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:36:33,529 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:33,667 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-02 20:36:33,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:36:33,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 [2022-11-02 20:36:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:33,669 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:36:33,669 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:36:33,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:36:33,670 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 85 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:33,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 66 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:36:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:36:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-02 20:36:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 75 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) [2022-11-02 20:36:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-11-02 20:36:33,673 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 31 [2022-11-02 20:36:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:33,673 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-11-02 20:36:33,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-11-02 20:36:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:36:33,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:33,674 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:33,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:36:33,676 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:33,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1691393914, now seen corresponding path program 2 times [2022-11-02 20:36:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:33,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110240280] [2022-11-02 20:36:33,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:33,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:33,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:33,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110240280] [2022-11-02 20:36:33,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110240280] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:33,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655243416] [2022-11-02 20:36:33,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:36:33,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:33,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:33,841 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:33,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:36:34,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:36:34,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:36:34,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:36:34,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:34,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:36:34,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655243416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:34,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:36:34,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-02 20:36:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707730489] [2022-11-02 20:36:34,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:34,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:36:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:36:34,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:34,112 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:34,127 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-11-02 20:36:34,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:36:34,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 [2022-11-02 20:36:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:34,128 INFO L225 Difference]: With dead ends: 60 [2022-11-02 20:36:34,129 INFO L226 Difference]: Without dead ends: 60 [2022-11-02 20:36:34,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:34,130 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:34,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 64 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:36:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-02 20:36:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-02 20:36:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.297872340425532) internal successors, (61), 59 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) [2022-11-02 20:36:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-11-02 20:36:34,139 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 34 [2022-11-02 20:36:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:34,139 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-11-02 20:36:34,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-11-02 20:36:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:36:34,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:34,141 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:34,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:34,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:34,367 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:34,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1472458184, now seen corresponding path program 1 times [2022-11-02 20:36:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:34,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309255948] [2022-11-02 20:36:34,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:34,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:36:34,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:34,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309255948] [2022-11-02 20:36:34,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309255948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:34,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:34,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:36:34,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037112925] [2022-11-02 20:36:34,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:34,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:36:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:34,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:36:34,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:36:34,499 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:34,560 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-11-02 20:36:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:36:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 35 [2022-11-02 20:36:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:34,562 INFO L225 Difference]: With dead ends: 58 [2022-11-02 20:36:34,562 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 20:36:34,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:36:34,563 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:34,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 31 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:36:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 20:36:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-02 20:36:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2022-11-02 20:36:34,566 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 35 [2022-11-02 20:36:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:34,567 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2022-11-02 20:36:34,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2022-11-02 20:36:34,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:36:34,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:34,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:34,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:36:34,568 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:34,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1472458185, now seen corresponding path program 1 times [2022-11-02 20:36:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:34,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695977370] [2022-11-02 20:36:34,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:34,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:36:34,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:34,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695977370] [2022-11-02 20:36:34,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695977370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:34,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850207449] [2022-11-02 20:36:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:34,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:34,770 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:34,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:36:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:34,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:36:34,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:36:35,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:36:35,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850207449] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:36:35,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:36:35,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-02 20:36:35,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554511239] [2022-11-02 20:36:35,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:35,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:35,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:35,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:35,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:35,151 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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) [2022-11-02 20:36:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:35,198 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-11-02 20:36:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:35,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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 35 [2022-11-02 20:36:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:35,202 INFO L225 Difference]: With dead ends: 62 [2022-11-02 20:36:35,202 INFO L226 Difference]: Without dead ends: 62 [2022-11-02 20:36:35,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:36:35,203 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:35,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 125 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:36:35,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-02 20:36:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-02 20:36:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 61 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) [2022-11-02 20:36:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-11-02 20:36:35,206 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 35 [2022-11-02 20:36:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:35,206 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-11-02 20:36:35,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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) [2022-11-02 20:36:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-11-02 20:36:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:36:35,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:35,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:35,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:35,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:36:35,419 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:35,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1472458212, now seen corresponding path program 1 times [2022-11-02 20:36:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:35,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668701933] [2022-11-02 20:36:35,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:35,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:36:35,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:35,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668701933] [2022-11-02 20:36:35,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668701933] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:35,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666879558] [2022-11-02 20:36:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:35,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:35,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:35,708 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:35,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:36:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:35,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:36:35,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:36:36,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:36,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:36,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:36:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:36:36,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666879558] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:36:36,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:36:36,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-02 20:36:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693840203] [2022-11-02 20:36:36,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:36,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:36:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:36,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:36:36,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:36:36,222 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 10 states, 9 states have (on average 6.0) 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) [2022-11-02 20:36:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:36,296 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-11-02 20:36:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:36:36,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) 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 35 [2022-11-02 20:36:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:36,298 INFO L225 Difference]: With dead ends: 60 [2022-11-02 20:36:36,298 INFO L226 Difference]: Without dead ends: 60 [2022-11-02 20:36:36,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:36:36,299 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 137 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:36,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 50 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:36:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-02 20:36:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-02 20:36:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.196078431372549) internal successors, (61), 59 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) [2022-11-02 20:36:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-11-02 20:36:36,301 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 35 [2022-11-02 20:36:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:36,301 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-11-02 20:36:36,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) 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) [2022-11-02 20:36:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-11-02 20:36:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:36:36,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:36,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:36,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:36,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:36,511 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:36,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:36,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1598435685, now seen corresponding path program 1 times [2022-11-02 20:36:36,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:36,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971003512] [2022-11-02 20:36:36,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:36,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:38,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:38,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971003512] [2022-11-02 20:36:38,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971003512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:38,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985112373] [2022-11-02 20:36:38,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:38,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:38,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:38,201 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:38,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:36:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:38,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 20:36:38,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:38,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:36:38,589 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:36:38,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:36:38,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:36:38,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:36:38,731 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:36:38,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-02 20:36:39,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-02 20:36:39,416 INFO L356 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-02 20:36:39,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 50 [2022-11-02 20:36:39,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-11-02 20:36:39,890 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:36:39,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-02 20:36:40,150 INFO L356 Elim1Store]: treesize reduction 62, result has 47.9 percent of original size [2022-11-02 20:36:40,150 INFO L390 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 5 case distinctions, treesize of input 90 treesize of output 101 [2022-11-02 20:36:41,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:41,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 200 [2022-11-02 20:36:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:42,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:42,810 INFO L356 Elim1Store]: treesize reduction 13, result has 78.7 percent of original size [2022-11-02 20:36:42,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 99 [2022-11-02 20:36:43,705 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (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|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1720 (Array Int Int))) (not (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1720) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-02 20:36:43,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2022-11-02 20:36:43,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= .cse0 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-02 20:36:43,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (or (not (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) is different from false [2022-11-02 20:36:43,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse1 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-02 20:36:43,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1719 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1719))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse1 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (= |ULTIMATE.start_main_~#s~0#1.base| .cse0) (not (= (select (select (store .cse1 .cse0 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2))))))) is different from false [2022-11-02 20:36:43,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1717 Int) (v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1719 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1717)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1719))) (let ((.cse2 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse0 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= (select (select (store .cse0 .cse1 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1)) (= |ULTIMATE.start_main_~#s~0#1.base| .cse1) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) is different from false [2022-11-02 20:36:43,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:43,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 97 [2022-11-02 20:36:43,910 INFO L356 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-11-02 20:36:43,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 615 treesize of output 429 [2022-11-02 20:36:43,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 324 treesize of output 308 [2022-11-02 20:36:43,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:43,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 378 treesize of output 308 [2022-11-02 20:36:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-02 20:36:44,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985112373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:36:44,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:36:44,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 58 [2022-11-02 20:36:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679961858] [2022-11-02 20:36:44,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:44,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-02 20:36:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:44,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-02 20:36:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2544, Unknown=57, NotChecked=642, Total=3422 [2022-11-02 20:36:44,267 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 59 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 59 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:44,766 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse5 .cse4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_1717 Int) (v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1719 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1717)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1719))) (let ((.cse3 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse3) .cse4))) (or (not (= (select (select (store .cse1 .cse2 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2)) (= |ULTIMATE.start_main_~#s~0#1.base| .cse2) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-11-02 20:36:44,774 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1719 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1719))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse2 .cse3) .cse4))) (or (= |ULTIMATE.start_main_~#s~0#1.base| .cse1) (not (= (select (select (store .cse2 .cse1 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3))))))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-02 20:36:44,780 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1720 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1719 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1719))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse2 .cse3) .cse4))) (or (= |ULTIMATE.start_main_~#s~0#1.base| .cse1) (not (= (select (select (store .cse2 .cse1 v_ArrVal_1720) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3))))))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-02 20:36:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:47,181 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-11-02 20:36:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:36:47,182 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 59 states have internal predecessors, (105), 0 states have call successors, (0), 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 36 [2022-11-02 20:36:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:47,183 INFO L225 Difference]: With dead ends: 63 [2022-11-02 20:36:47,183 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 20:36:47,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=391, Invalid=4415, Unknown=60, NotChecked=1296, Total=6162 [2022-11-02 20:36:47,188 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 80 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:47,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 636 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 495 Invalid, 0 Unknown, 401 Unchecked, 0.5s Time] [2022-11-02 20:36:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 20:36:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-02 20:36:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 61 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) [2022-11-02 20:36:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-11-02 20:36:47,191 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 36 [2022-11-02 20:36:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:47,191 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-11-02 20:36:47,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 59 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-11-02 20:36:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:36:47,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:47,193 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:47,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:47,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:47,407 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:36:47,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:47,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1598435684, now seen corresponding path program 1 times [2022-11-02 20:36:47,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:47,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083133994] [2022-11-02 20:36:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:47,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:48,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083133994] [2022-11-02 20:36:48,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083133994] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:48,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407906187] [2022-11-02 20:36:48,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:48,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:48,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:48,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:48,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:36:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:48,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-02 20:36:48,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:49,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:36:49,174 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:36:49,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:36:49,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:36:49,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:36:49,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:36:49,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:36:49,454 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:36:49,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-02 20:36:49,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:36:50,327 INFO L356 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-02 20:36:50,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 79 [2022-11-02 20:36:50,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:36:50,371 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-02 20:36:50,371 INFO L390 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 54 [2022-11-02 20:36:50,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:50,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:36:50,815 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-11-02 20:36:50,815 INFO L390 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 3 case distinctions, treesize of input 126 treesize of output 85 [2022-11-02 20:36:50,843 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-02 20:36:50,843 INFO L390 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 4 case distinctions, treesize of input 74 treesize of output 53 [2022-11-02 20:36:51,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:51,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 27 [2022-11-02 20:36:51,141 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:51,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2022-11-02 20:36:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:51,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:51,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:51,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 80 [2022-11-02 20:36:51,785 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_1858 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_first_~temp~1#1.base| v_ArrVal_1858))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_remove_first_~head#1.base|))) (or (<= 0 (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_remove_first_~head#1.offset| |c_ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (not (= 0 (select .cse5 |c_ULTIMATE.start_dll_remove_first_~head#1.offset|))))))))) (and (forall ((v_ArrVal_1858 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_first_~temp~1#1.base| v_ArrVal_1858))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_remove_first_~head#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_remove_first_~head#1.offset| |c_ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_dll_remove_first_~temp~1#1.offset| 5)) (not (= 0 (select .cse1 |c_ULTIMATE.start_dll_remove_first_~head#1.offset|))))))) .cse2 (or (and .cse2 (forall ((v_ArrVal_1858 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_first_~temp~1#1.base| v_ArrVal_1858) |c_ULTIMATE.start_dll_remove_first_~head#1.base|) |c_ULTIMATE.start_dll_remove_first_~head#1.offset|))))) (forall ((v_ArrVal_1859 (Array Int Int))) (= |c_ULTIMATE.start_dll_remove_first_~temp~1#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_first_~temp~1#1.base| v_ArrVal_1859))) (store .cse3 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_remove_first_~head#1.base|) |c_ULTIMATE.start_dll_remove_first_~head#1.offset| |c_ULTIMATE.start_dll_remove_first_~temp~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-02 20:36:51,869 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_1858 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_first_#t~mem7#1.base| v_ArrVal_1858))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_remove_first_~head#1.base|))) (or (<= 0 (+ (select (select (store .cse4 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_remove_first_~head#1.offset| |c_ULTIMATE.start_dll_remove_first_#t~mem7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (not (= (select .cse5 |c_ULTIMATE.start_dll_remove_first_~head#1.offset|) 0)))))))) (and (forall ((v_ArrVal_1858 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_first_#t~mem7#1.base| v_ArrVal_1858))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_remove_first_~head#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_remove_first_~head#1.offset| |c_ULTIMATE.start_dll_remove_first_#t~mem7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_dll_remove_first_#t~mem7#1.offset| 5)) (not (= (select .cse1 |c_ULTIMATE.start_dll_remove_first_~head#1.offset|) 0)))))) .cse2 (or (forall ((v_ArrVal_1859 (Array Int Int))) (= |c_ULTIMATE.start_dll_remove_first_#t~mem7#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_first_#t~mem7#1.base| v_ArrVal_1859))) (store .cse3 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_remove_first_~head#1.base|) |c_ULTIMATE.start_dll_remove_first_~head#1.offset| |c_ULTIMATE.start_dll_remove_first_#t~mem7#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and .cse2 (forall ((v_ArrVal_1858 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_first_#t~mem7#1.base| v_ArrVal_1858) |c_ULTIMATE.start_dll_remove_first_~head#1.base|) |c_ULTIMATE.start_dll_remove_first_~head#1.offset|) 0))))))) is different from false [2022-11-02 20:36:51,919 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_dll_remove_first_#t~mem6#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_first_#t~mem6#1.base|) .cse8)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_first_#t~mem6#1.base|) .cse8))) (let ((.cse4 (forall ((v_ArrVal_1858 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1858))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_dll_remove_first_~head#1.base|))) (or (<= 0 (+ 4 (select (select (store .cse6 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_remove_first_~head#1.offset| .cse2)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse7 |c_ULTIMATE.start_dll_remove_first_~head#1.offset|) 0)))))))) (and (forall ((v_ArrVal_1858 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1858))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_remove_first_~head#1.base|))) (or (not (= (select .cse0 |c_ULTIMATE.start_dll_remove_first_~head#1.offset|) 0)) (< (select (select (store .cse1 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_remove_first_~head#1.offset| .cse2)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ 5 .cse2)))))) (or (and (forall ((v_ArrVal_1858 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1858) |c_ULTIMATE.start_dll_remove_first_~head#1.base|) |c_ULTIMATE.start_dll_remove_first_~head#1.offset|) 0))) .cse4) (forall ((v_ArrVal_1859 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1859))) (store .cse5 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_remove_first_~head#1.base|) |c_ULTIMATE.start_dll_remove_first_~head#1.offset| .cse3))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse3))) .cse4)))) is different from false [2022-11-02 20:36:51,983 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_first_~head#1.base|) |c_ULTIMATE.start_dll_remove_first_~head#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_first_~head#1.base|) |c_ULTIMATE.start_dll_remove_first_~head#1.offset|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9))) (let ((.cse0 (forall ((v_ArrVal_1858 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1858))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_dll_remove_first_~head#1.base|))) (or (not (= (select .cse6 |c_ULTIMATE.start_dll_remove_first_~head#1.offset|) 0)) (<= 0 (+ 4 (select (select (store .cse7 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_remove_first_~head#1.offset| .cse5)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (and .cse0 (or (and .cse0 (forall ((v_ArrVal_1858 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1858) |c_ULTIMATE.start_dll_remove_first_~head#1.base|) |c_ULTIMATE.start_dll_remove_first_~head#1.offset|) 0)))) (forall ((v_ArrVal_1859 (Array Int Int))) (= .cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1859))) (store .cse2 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_remove_first_~head#1.base|) |c_ULTIMATE.start_dll_remove_first_~head#1.offset| .cse1))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1858 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1858))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_dll_remove_first_~head#1.base|))) (or (not (= (select .cse3 |c_ULTIMATE.start_dll_remove_first_~head#1.offset|) 0)) (< (select (select (store .cse4 |c_ULTIMATE.start_dll_remove_first_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_remove_first_~head#1.offset| .cse5)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ 5 .cse5)))))))))) is different from false [2022-11-02 20:36:51,999 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= 0 (+ 4 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (forall ((v_ArrVal_1858 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) v_ArrVal_1858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2022-11-02 20:36:52,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1857 (Array Int Int)) (v_ArrVal_1856 (Array Int Int)) (v_ArrVal_1858 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1856))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1857)) (.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (+ .cse3 4)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse0 .cse1) .cse2) 4)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse0 (select (select .cse4 .cse1) .cse2) v_ArrVal_1858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) is different from false [2022-11-02 20:36:52,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1857 (Array Int Int)) (v_ArrVal_1856 (Array Int Int)) (v_ArrVal_1853 Int) (v_ArrVal_1854 Int) (v_ArrVal_1858 (Array Int Int))) (let ((.cse5 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_1853)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1856))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_1854)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1857)) (.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (+ .cse4 4)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse0 (select (select .cse1 .cse2) .cse3) v_ArrVal_1858) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse0 .cse2) .cse3) 4)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse4)))))))) is different from false [2022-11-02 20:36:52,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:52,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 142 [2022-11-02 20:36:52,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:52,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 97 [2022-11-02 20:36:52,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:52,536 INFO L356 Elim1Store]: treesize reduction 23, result has 72.6 percent of original size [2022-11-02 20:36:52,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 245 [2022-11-02 20:36:52,863 INFO L356 Elim1Store]: treesize reduction 75, result has 63.2 percent of original size [2022-11-02 20:36:52,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 736 treesize of output 764 [2022-11-02 20:36:52,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 378 [2022-11-02 20:36:52,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:52,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 667 treesize of output 645 [2022-11-02 20:36:53,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:53,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 530 treesize of output 502 [2022-11-02 20:36:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-02 20:36:56,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407906187] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:36:56,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:36:56,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 55 [2022-11-02 20:36:56,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144396519] [2022-11-02 20:36:56,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:56,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-02 20:36:56,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:56,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-02 20:36:56,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2149, Unknown=7, NotChecked=700, Total=3080 [2022-11-02 20:36:56,738 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:59,784 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-11-02 20:36:59,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:36:59,784 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 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 36 [2022-11-02 20:36:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:59,785 INFO L225 Difference]: With dead ends: 63 [2022-11-02 20:36:59,785 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 20:36:59,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=490, Invalid=3563, Unknown=7, NotChecked=910, Total=4970 [2022-11-02 20:36:59,788 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 155 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:59,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 518 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 537 Invalid, 0 Unknown, 401 Unchecked, 0.7s Time] [2022-11-02 20:36:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 20:36:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-02 20:36:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 61 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) [2022-11-02 20:36:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-11-02 20:36:59,791 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 36 [2022-11-02 20:36:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:59,792 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-11-02 20:36:59,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-11-02 20:36:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:36:59,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:59,793 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:36:59,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:00,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-02 20:37:00,004 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-02 20:37:00,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:00,004 INFO L85 PathProgramCache]: Analyzing trace with hash -695048217, now seen corresponding path program 1 times [2022-11-02 20:37:00,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:00,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883835744] [2022-11-02 20:37:00,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:00,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:37:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:04,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883835744] [2022-11-02 20:37:04,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883835744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:04,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438614978] [2022-11-02 20:37:04,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:04,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:04,655 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:04,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1b44f92-cd20-408e-8f8c-e22e2362c70a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:37:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:04,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-02 20:37:04,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:04,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:37:05,023 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:37:05,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:37:05,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:37:05,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:37:05,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:37:05,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:37:05,465 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:37:05,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:37:05,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:37:05,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:37:05,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:37:05,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:37:05,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 20:37:05,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 20:37:05,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:05,937 INFO L356 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2022-11-02 20:37:05,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 72 [2022-11-02 20:37:05,973 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-02 20:37:05,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-11-02 20:37:07,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:07,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:07,385 INFO L356 Elim1Store]: treesize reduction 226, result has 12.1 percent of original size [2022-11-02 20:37:07,385 INFO L390 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 7 new quantified variables, introduced 14 case distinctions, treesize of input 155 treesize of output 100 [2022-11-02 20:37:07,420 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-02 20:37:07,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 78 [2022-11-02 20:37:07,791 INFO L356 Elim1Store]: treesize reduction 77, result has 14.4 percent of original size [2022-11-02 20:37:07,792 INFO L390 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 90 [2022-11-02 20:37:07,800 INFO L390 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2022-11-02 20:37:08,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:08,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:08,473 INFO L356 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-11-02 20:37:08,474 INFO L390 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 44 [2022-11-02 20:37:08,500 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:37:08,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2022-11-02 20:37:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:37:08,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:54,211 WARN L234 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:37:56,289 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_2005 Int) (v_ArrVal_2004 Int) (v_ArrVal_2008 Int)) (let ((.cse11 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse12 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse3 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse14 .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 v_ArrVal_2005)))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2008))))) (let ((.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2006 Int)) (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse10 .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse12 v_ArrVal_2004)))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2006))))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_ArrVal_2013 Int)) (= (let ((.cse6 (+ .cse0 4))) (let ((.cse4 (select (select .cse7 .cse5) .cse6))) (select (let ((.cse2 (select (select .cse3 .cse5) .cse6))) (select (let ((.cse1 (store .cse3 .cse2 (store (select .cse3 .cse2) (+ .cse4 8) v_ArrVal_2013)))) (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| .cse2))) .cse2)) (+ .cse4 4)))) 0)))))) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_2005 Int) (v_ArrVal_2004 Int) (v_ArrVal_2008 Int)) (let ((.cse24 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse25 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse20 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse14 .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse25 v_ArrVal_2005)))) (store .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2008))))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2006 Int)) (let ((.cse18 (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse10 .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse25 v_ArrVal_2004)))) (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2006))))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse15 |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_ArrVal_2012 Int)) (= (let ((.cse22 (+ .cse15 4))) (let ((.cse17 (select (select .cse18 .cse21) .cse22))) (select (let ((.cse19 (select (select .cse20 .cse21) .cse22))) (select (let ((.cse16 (store .cse18 .cse19 (store (select .cse18 .cse19) (+ .cse17 8) v_ArrVal_2012)))) (store .cse16 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| .cse17))) .cse19)) (+ .cse17 4)))) 0)))))) (not (= .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))) is different from false [2022-11-02 20:37:56,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:56,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1324 treesize of output 940 [2022-11-02 20:37:56,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:56,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 944 treesize of output 700 [2022-11-02 20:37:56,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:56,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1324 treesize of output 1040 [2022-11-02 20:37:56,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:56,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1044 treesize of output 700 [2022-11-02 20:37:56,631 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_2013 Int) (v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_2006 Int) (v_ArrVal_2008 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse6 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_20))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_2006)))) (.cse3 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_2008))))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (let ((.cse4 (select (select .cse6 .cse0) .cse5))) (select (let ((.cse2 (select (select .cse3 .cse0) .cse5))) (select (let ((.cse1 (store .cse3 .cse2 (store (select .cse3 .cse2) (+ .cse4 8) v_ArrVal_2013)))) (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| .cse2))) .cse2)) (+ .cse4 4))) 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_20 .cse5))) (not (= (select v_arrayElimArr_19 .cse5) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_2012 Int) (v_ArrVal_2006 Int) (v_ArrVal_2008 Int)) (let ((.cse14 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_22))) (store .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_2006)))) (.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_21))) (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_2008))))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (+ (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_22 .cse10))) (not (= (select v_arrayElimArr_21 .cse10) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (let ((.cse13 (select (select .cse14 .cse11) .cse10))) (select (let ((.cse15 (select (select .cse16 .cse11) .cse10))) (select (let ((.cse12 (store .cse14 .cse15 (store (select .cse14 .cse15) (+ .cse13 8) v_ArrVal_2012)))) (store .cse12 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| .cse13))) .cse15)) (+ .cse13 4))) 0))))))) is different from false [2022-11-02 20:38:06,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:06,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1644 treesize of output 1064 [2022-11-02 20:38:06,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:06,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1136 treesize of output 736 [2022-11-02 20:38:06,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:38:14,679 WARN L234 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 308 DAG size of output: 200 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-02 20:38:14,680 INFO L356 Elim1Store]: treesize reduction 517, result has 45.4 percent of original size [2022-11-02 20:38:14,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 19 new quantified variables, introduced 66 case distinctions, treesize of input 1025722 treesize of output 928949