./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8 --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 c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- 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-2329fc7 [2022-12-13 14:33:23,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:33:23,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:33:23,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:33:23,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:33:23,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:33:23,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:33:23,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:33:23,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:33:23,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:33:23,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:33:23,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:33:23,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:33:23,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:33:23,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:33:23,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:33:23,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:33:23,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:33:23,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:33:23,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:33:23,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:33:23,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:33:23,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:33:23,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:33:23,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:33:23,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:33:23,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:33:23,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:33:23,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:33:23,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:33:23,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:33:23,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:33:23,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:33:23,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:33:23,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:33:23,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:33:23,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:33:23,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:33:23,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:33:23,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:33:23,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:33:23,682 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 14:33:23,704 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:33:23,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:33:23,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:33:23,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:33:23,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:33:23,706 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:33:23,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:33:23,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:33:23,707 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:33:23,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:33:23,707 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:33:23,707 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:33:23,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:33:23,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:33:23,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:33:23,708 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 14:33:23,708 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 14:33:23,708 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 14:33:23,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:33:23,709 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 14:33:23,709 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:33:23,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:33:23,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:33:23,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:33:23,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:33:23,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:33:23,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:33:23,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:33:23,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:33:23,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:33:23,711 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:33:23,711 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:33:23,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:33:23,711 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:33:23,712 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/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_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8 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 -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2022-12-13 14:33:23,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:33:23,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:33:23,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:33:23,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:33:23,921 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:33:23,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-12-13 14:33:26,469 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:33:26,656 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:33:26,657 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-12-13 14:33:26,665 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/data/a9a15626c/06d652fcc58547c2b8e38dab56809b26/FLAG4114692da [2022-12-13 14:33:26,677 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/data/a9a15626c/06d652fcc58547c2b8e38dab56809b26 [2022-12-13 14:33:26,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:33:26,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:33:26,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:33:26,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:33:26,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:33:26,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:26,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c414c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26, skipping insertion in model container [2022-12-13 14:33:26,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:26,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:33:26,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:33:26,925 WARN L237 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_f791c83b-d981-43b0-9a9a-2157bbd1eae7/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2022-12-13 14:33:26,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:33:26,939 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:33:26,974 WARN L237 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_f791c83b-d981-43b0-9a9a-2157bbd1eae7/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2022-12-13 14:33:26,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:33:26,998 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:33:26,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26 WrapperNode [2022-12-13 14:33:26,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:33:27,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:33:27,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:33:27,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:33:27,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,035 INFO L138 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-12-13 14:33:27,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:33:27,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:33:27,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:33:27,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:33:27,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,059 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:33:27,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:33:27,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:33:27,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:33:27,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (1/1) ... [2022-12-13 14:33:27,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:33:27,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:33:27,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:33:27,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:33:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-12-13 14:33:27,117 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-12-13 14:33:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 14:33:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 14:33:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 14:33:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:33:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 14:33:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 14:33:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:33:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:33:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:33:27,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:33:27,202 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:33:27,204 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:33:27,224 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-12-13 14:33:27,391 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:33:27,396 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:33:27,397 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 14:33:27,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:33:27 BoogieIcfgContainer [2022-12-13 14:33:27,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:33:27,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:33:27,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:33:27,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:33:27,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:33:26" (1/3) ... [2022-12-13 14:33:27,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4937b45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:33:27, skipping insertion in model container [2022-12-13 14:33:27,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:26" (2/3) ... [2022-12-13 14:33:27,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4937b45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:33:27, skipping insertion in model container [2022-12-13 14:33:27,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:33:27" (3/3) ... [2022-12-13 14:33:27,406 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2022-12-13 14:33:27,419 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:33:27,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-12-13 14:33:27,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:33:27,465 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=PETRI_NET, 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;@5b8f2fea, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:33:27,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-12-13 14:33:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 14:33:27,474 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:27,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 14:33:27,475 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-12-13 14:33:27,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-12-13 14:33:27,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:27,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866801208] [2022-12-13 14:33:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:33:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:27,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866801208] [2022-12-13 14:33:27,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866801208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:27,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:27,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:33:27,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150213265] [2022-12-13 14:33:27,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:27,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:33:27,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:27,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:27,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:27,700 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-13 14:33:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:27,771 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-12-13 14:33:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:27,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-13 14:33:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:27,780 INFO L225 Difference]: With dead ends: 76 [2022-12-13 14:33:27,780 INFO L226 Difference]: Without dead ends: 70 [2022-12-13 14:33:27,782 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-12-13 14:33:27,785 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:27,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:33:27,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-13 14:33:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2022-12-13 14:33:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.78125) 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-12-13 14:33:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-12-13 14:33:27,817 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2022-12-13 14:33:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:27,818 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-12-13 14:33:27,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-13 14:33:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-12-13 14:33:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 14:33:27,819 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:27,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 14:33:27,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:33:27,819 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-12-13 14:33:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-12-13 14:33:27,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:27,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455636056] [2022-12-13 14:33:27,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:33:27,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:27,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455636056] [2022-12-13 14:33:27,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455636056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:27,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:27,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:33:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673274852] [2022-12-13 14:33:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:27,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:33:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:27,915 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-13 14:33:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:27,954 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-12-13 14:33:27,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:27,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-13 14:33:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:27,955 INFO L225 Difference]: With dead ends: 51 [2022-12-13 14:33:27,955 INFO L226 Difference]: Without dead ends: 51 [2022-12-13 14:33:27,955 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-12-13 14:33:27,957 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:27,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:33:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-13 14:33:27,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-12-13 14:33:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.6875) 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-12-13 14:33:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-12-13 14:33:27,962 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2022-12-13 14:33:27,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:27,963 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-12-13 14:33:27,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-13 14:33:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-12-13 14:33:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 14:33:27,963 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:27,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:27,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:33:27,964 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-12-13 14:33:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:27,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402842111] [2022-12-13 14:33:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:33:28,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:28,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402842111] [2022-12-13 14:33:28,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402842111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:28,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:28,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:33:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441822618] [2022-12-13 14:33:28,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:28,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:33:28,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:28,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:28,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:28,039 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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-12-13 14:33:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:28,096 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-12-13 14:33:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:28,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-12-13 14:33:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:28,097 INFO L225 Difference]: With dead ends: 82 [2022-12-13 14:33:28,097 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 14:33:28,098 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-12-13 14:33:28,099 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:28,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:33:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 14:33:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2022-12-13 14:33:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.625) 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-12-13 14:33:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-12-13 14:33:28,104 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2022-12-13 14:33:28,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:28,105 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-12-13 14:33:28,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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-12-13 14:33:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-12-13 14:33:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 14:33:28,105 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:28,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:28,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:33:28,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:28,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-12-13 14:33:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:28,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870586904] [2022-12-13 14:33:28,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:28,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:33:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:28,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870586904] [2022-12-13 14:33:28,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870586904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:28,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:28,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:33:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605615399] [2022-12-13 14:33:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:28,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:33:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:28,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:28,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:28,205 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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-12-13 14:33:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:28,254 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-12-13 14:33:28,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:28,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-12-13 14:33:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:28,256 INFO L225 Difference]: With dead ends: 84 [2022-12-13 14:33:28,256 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 14:33:28,256 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-12-13 14:33:28,257 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:28,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 104 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:33:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 14:33:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2022-12-13 14:33:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 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-12-13 14:33:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-12-13 14:33:28,262 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2022-12-13 14:33:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:28,263 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-12-13 14:33:28,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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-12-13 14:33:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-12-13 14:33:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 14:33:28,263 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:28,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:28,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:33:28,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2022-12-13 14:33:28,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:28,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390979561] [2022-12-13 14:33:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:33:28,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:28,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390979561] [2022-12-13 14:33:28,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390979561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:28,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:28,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:28,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578999735] [2022-12-13 14:33:28,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:28,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:33:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:28,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:28,320 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:28,327 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-12-13 14:33:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:28,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 14:33:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:28,328 INFO L225 Difference]: With dead ends: 52 [2022-12-13 14:33:28,328 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 14:33:28,328 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-12-13 14:33:28,329 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 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-12-13 14:33:28,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:33:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 14:33:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-12-13 14:33:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.5454545454545454) 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-12-13 14:33:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-12-13 14:33:28,334 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 11 [2022-12-13 14:33:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:28,334 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-12-13 14:33:28,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-12-13 14:33:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 14:33:28,335 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:28,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:28,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:33:28,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2022-12-13 14:33:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:28,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157209934] [2022-12-13 14:33:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:33:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:28,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157209934] [2022-12-13 14:33:28,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157209934] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:33:28,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658401609] [2022-12-13 14:33:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:28,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:33:28,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:33:28,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:33:28,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 14:33:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:28,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:33:28,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:33:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:33:28,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:33:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:33:28,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658401609] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:33:28,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:33:28,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 14:33:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915711200] [2022-12-13 14:33:28,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:33:28,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:33:28,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:28,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:33:28,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:33:28,561 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-12-13 14:33:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:28,579 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-12-13 14:33:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:33:28,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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 16 [2022-12-13 14:33:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:28,581 INFO L225 Difference]: With dead ends: 63 [2022-12-13 14:33:28,581 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 14:33:28,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:33:28,582 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:28,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:33:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 14:33:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-13 14:33:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-13 14:33:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-12-13 14:33:28,587 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 16 [2022-12-13 14:33:28,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:28,587 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-12-13 14:33:28,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-12-13 14:33:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-12-13 14:33:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 14:33:28,588 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:28,588 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:28,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 14:33:28,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:33:28,790 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2022-12-13 14:33:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:28,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878457527] [2022-12-13 14:33:28,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:28,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 14:33:29,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:29,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878457527] [2022-12-13 14:33:29,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878457527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:29,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:29,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:33:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387820110] [2022-12-13 14:33:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:29,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:33:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:33:29,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:33:29,066 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:29,176 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-12-13 14:33:29,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:33:29,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-13 14:33:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:29,178 INFO L225 Difference]: With dead ends: 75 [2022-12-13 14:33:29,178 INFO L226 Difference]: Without dead ends: 75 [2022-12-13 14:33:29,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:33:29,179 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 124 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:29,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 66 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:33:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-13 14:33:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2022-12-13 14:33:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 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-12-13 14:33:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-12-13 14:33:29,182 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 31 [2022-12-13 14:33:29,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:29,182 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-12-13 14:33:29,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-12-13 14:33:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 14:33:29,183 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:29,183 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:29,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:33:29,183 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:29,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:29,183 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2022-12-13 14:33:29,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:29,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983145429] [2022-12-13 14:33:29,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 14:33:29,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:29,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983145429] [2022-12-13 14:33:29,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983145429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:29,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:29,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:33:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850549963] [2022-12-13 14:33:29,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:29,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:33:29,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:29,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:33:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:33:29,378 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-12-13 14:33:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:29,486 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-12-13 14:33:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:33:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 31 [2022-12-13 14:33:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:29,487 INFO L225 Difference]: With dead ends: 66 [2022-12-13 14:33:29,487 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 14:33:29,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:33:29,488 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:29,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 47 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:33:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 14:33:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2022-12-13 14:33:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 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-12-13 14:33:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-12-13 14:33:29,490 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2022-12-13 14:33:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:29,491 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-12-13 14:33:29,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-12-13 14:33:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-12-13 14:33:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 14:33:29,491 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:29,491 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:29,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:33:29,491 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:29,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash 142544431, now seen corresponding path program 1 times [2022-12-13 14:33:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:29,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276213533] [2022-12-13 14:33:29,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:29,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 14:33:30,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:30,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276213533] [2022-12-13 14:33:30,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276213533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:33:30,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028486263] [2022-12-13 14:33:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:30,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:33:30,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:33:30,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:33:30,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 14:33:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:30,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 14:33:30,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:33:30,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 14:33:30,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:30,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 14:33:30,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:33:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 14:33:30,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:33:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 14:33:30,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028486263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:33:30,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:33:30,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-12-13 14:33:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093219129] [2022-12-13 14:33:30,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:33:30,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 14:33:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:30,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 14:33:30,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-12-13 14:33:30,691 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 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-12-13 14:33:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:30,958 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-12-13 14:33:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 14:33:30,958 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-13 14:33:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:30,959 INFO L225 Difference]: With dead ends: 63 [2022-12-13 14:33:30,959 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 14:33:30,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2022-12-13 14:33:30,960 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:30,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 325 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:33:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 14:33:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-13 14:33:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-13 14:33:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-12-13 14:33:30,965 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 33 [2022-12-13 14:33:30,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:30,966 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-12-13 14:33:30,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 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-12-13 14:33:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-12-13 14:33:30,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 14:33:30,966 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:30,966 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:30,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 14:33:31,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:33:31,168 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:31,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:31,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2022-12-13 14:33:31,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:31,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353573918] [2022-12-13 14:33:31,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:31,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:31,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:31,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353573918] [2022-12-13 14:33:31,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353573918] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:33:31,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44917135] [2022-12-13 14:33:31,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:31,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:33:31,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:33:31,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:33:31,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 14:33:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:32,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 14:33:32,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:33:32,047 INFO L350 Elim1Store]: Elim1 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-12-13 14:33:32,084 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 14:33:32,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 14:33:32,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:33:32,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:33:32,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:32,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 14:33:32,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:32,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-12-13 14:33:32,253 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:33:32,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 14:33:32,264 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 14:33:32,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-12-13 14:33:32,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:32,557 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:33:32,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2022-12-13 14:33:32,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:32,566 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:33:32,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2022-12-13 14:33:32,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:32,602 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2022-12-13 14:33:32,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:32,611 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 31 [2022-12-13 14:33:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:32,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:33:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:33,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44917135] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:33:33,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:33:33,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 27 [2022-12-13 14:33:33,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989171993] [2022-12-13 14:33:33,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:33:33,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 14:33:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:33,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 14:33:33,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2022-12-13 14:33:33,071 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:34,703 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-12-13 14:33:34,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 14:33:34,704 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-12-13 14:33:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:34,706 INFO L225 Difference]: With dead ends: 122 [2022-12-13 14:33:34,706 INFO L226 Difference]: Without dead ends: 122 [2022-12-13 14:33:34,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=450, Invalid=1442, Unknown=0, NotChecked=0, Total=1892 [2022-12-13 14:33:34,707 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 874 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:34,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 261 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:33:34,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-13 14:33:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 72. [2022-12-13 14:33:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-12-13 14:33:34,711 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 37 [2022-12-13 14:33:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:34,711 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-12-13 14:33:34,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-12-13 14:33:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 14:33:34,712 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:34,712 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:34,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 14:33:34,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 14:33:34,914 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:34,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2022-12-13 14:33:34,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:34,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508035428] [2022-12-13 14:33:34,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:34,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:35,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:35,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508035428] [2022-12-13 14:33:35,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508035428] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:33:35,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769776250] [2022-12-13 14:33:35,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:35,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:33:35,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:33:35,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:33:35,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 14:33:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:35,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 14:33:35,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:33:35,897 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 14:33:35,897 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2022-12-13 14:33:35,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:33:35,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:33:35,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:35,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 14:33:35,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:35,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-12-13 14:33:36,057 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 14:33:36,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-12-13 14:33:36,067 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:33:36,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 14:33:36,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:36,289 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:33:36,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2022-12-13 14:33:36,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:36,296 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:33:36,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2022-12-13 14:33:36,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:36,324 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2022-12-13 14:33:36,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:36,331 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 31 [2022-12-13 14:33:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:36,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:33:37,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-12-13 14:33:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:37,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769776250] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:33:37,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:33:37,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 36 [2022-12-13 14:33:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759111993] [2022-12-13 14:33:37,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:33:37,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 14:33:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:37,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 14:33:37,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 14:33:37,082 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 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-12-13 14:33:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:41,450 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2022-12-13 14:33:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 14:33:41,450 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 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 37 [2022-12-13 14:33:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:41,451 INFO L225 Difference]: With dead ends: 135 [2022-12-13 14:33:41,451 INFO L226 Difference]: Without dead ends: 135 [2022-12-13 14:33:41,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=976, Invalid=3056, Unknown=0, NotChecked=0, Total=4032 [2022-12-13 14:33:41,452 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1129 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:41,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 251 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 14:33:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-12-13 14:33:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 74. [2022-12-13 14:33:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.25) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-12-13 14:33:41,454 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 37 [2022-12-13 14:33:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:41,455 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-12-13 14:33:41,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 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-12-13 14:33:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-12-13 14:33:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 14:33:41,455 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:41,455 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:41,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 14:33:41,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 14:33:41,657 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:41,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash -494379329, now seen corresponding path program 1 times [2022-12-13 14:33:41,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:41,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386603430] [2022-12-13 14:33:41,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:42,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386603430] [2022-12-13 14:33:42,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386603430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:33:42,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834922911] [2022-12-13 14:33:42,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:42,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:33:42,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:33:42,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:33:42,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 14:33:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:42,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-13 14:33:42,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:33:43,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 14:33:43,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:33:43,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:33:43,118 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 14:33:43,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-12-13 14:33:43,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 14:33:43,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:43,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-12-13 14:33:43,169 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 14:33:43,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2022-12-13 14:33:43,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:43,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 14:33:43,241 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 14:33:43,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-12-13 14:33:43,246 INFO L350 Elim1Store]: Elim1 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-12-13 14:33:43,255 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:33:43,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 14:33:43,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:43,518 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:33:43,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2022-12-13 14:33:43,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:43,528 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:33:43,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2022-12-13 14:33:43,540 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 14:33:43,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 51 [2022-12-13 14:33:43,561 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 14:33:43,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:43,580 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 34 [2022-12-13 14:33:43,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:43,589 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 33 [2022-12-13 14:33:43,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:33:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:43,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:33:45,542 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse6 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse44 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse13 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse42 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) (and (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse2) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse4 (select (store (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) .cse6 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse7 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse13) .cse2) .cse6 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse14 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse2) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (let ((.cse16 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse36 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse36 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse17 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse34 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse34 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))))))) (.cse23 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (and (or (and .cse16 .cse17 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse18 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse19 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))) .cse23 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse24 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse24 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse2) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse26 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse26 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse2) .cse16 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse2) .cse17 (or .cse2 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse29 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse29 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))))) .cse23 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))))))))) .cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse38 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse38 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse40 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse40 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse2) .cse13))) is different from false [2022-12-13 14:33:46,423 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse5 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse43 (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse43 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse43 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)))))))))) (.cse9 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse41 (select (store (let ((.cse42 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse41 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse41 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and .cse0 (or .cse1 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse2 (select (store (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse2 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) (or (and .cse0 .cse5 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse6 (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse6 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse6 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse9 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse12 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse1) .cse5 (or .cse1 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (or (let ((.cse17 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse35 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)))))))) (.cse21 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse33 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse22 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (and (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse15 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse15 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse1) (or (and .cse17 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse18 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse19 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse21 .cse22 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse23 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse25 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse25 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)))))) .cse1) .cse17 .cse21 .cse22 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse27 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse27 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse29 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse29 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3))))) .cse1) (or .cse1 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) .cse9 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse37 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse37 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse1) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse39 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse39 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))))))) is different from false [2022-12-13 14:33:46,840 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (forall ((v_subst_3 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_3) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_3) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| v_subst_3 v_ArrVal_969))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_3 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse11 (forall ((v_subst_8 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_8) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| v_subst_8 v_ArrVal_969))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_8 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse42 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse42 4))))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_8)))))) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse12 (forall ((v_subst_1 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse41 (store |c_#memory_int| v_subst_1 v_ArrVal_969))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_1 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_1))))))) (and .cse0 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_10 Int)) (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| v_subst_10 v_ArrVal_969))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_10 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse1 .cse2)) (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_10) (= (select .cse1 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_10)))) .cse4) (or (and .cse0 (forall ((v_subst_5 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_5) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| v_subst_5 v_ArrVal_969))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_5 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse2)) (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 4))))))) (forall ((v_subst_6 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| v_subst_6 v_ArrVal_969))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_6 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 4)) (= (select .cse7 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_6))) (forall ((v_subst_4 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_4) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| v_subst_4 v_ArrVal_969))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_4 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse11 .cse12 (forall ((v_subst_7 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_7) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse13 (store |c_#memory_int| v_subst_7 v_ArrVal_969))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_7 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse4) (or .cse4 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_11 Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| v_subst_11 v_ArrVal_969))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_11 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_11) (= (select .cse14 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_11))))) (or (let ((.cse16 (forall ((v_subst_13 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse37 (store |c_#memory_int| v_subst_13 v_ArrVal_969))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_13 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_13)))) (.cse17 (forall ((v_subst_15 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| v_subst_15 v_ArrVal_969))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_15 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse35 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse35 4))))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_15)))) (.cse25 (forall ((v_subst_16 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_16) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| v_subst_16 v_ArrVal_969))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_16 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse33 .cse2))))))))) (and .cse16 .cse17 (or .cse4 (and .cse16 .cse17 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_20 Int)) (= (select (select (store (let ((.cse18 (store |c_#memory_int| v_subst_20 v_ArrVal_969))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_20 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_973 Int) (v_subst_19 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| v_subst_19 v_ArrVal_969))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_19 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 4))))) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_21 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| v_subst_21 v_ArrVal_969))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_21 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_973 Int) (v_subst_18 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| v_subst_18 v_ArrVal_969))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_18 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse25)) (or (forall ((v_ArrVal_973 Int) (v_subst_12 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int| v_subst_12 v_ArrVal_969))) (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_12 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_12) (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse26 .cse2)) (= (select .cse26 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_22 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_22) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| v_subst_22 v_ArrVal_969))) (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_22 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse28 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 4))))))) (or (forall ((v_ArrVal_973 Int) (v_subst_14 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int| v_subst_14 v_ArrVal_969))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_14 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse30 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_14) (= (select .cse30 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (or (forall ((v_ArrVal_973 Int) (v_subst_17 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (= (select (select (store (let ((.cse32 (store |c_#memory_int| v_subst_17 v_ArrVal_969))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_17 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse4) .cse25)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (forall ((v_subst_2 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| v_subst_2 v_ArrVal_969))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_2 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 4)) (= (select .cse38 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_2))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_2))) .cse11 (or .cse4 (forall ((v_ArrVal_973 Int) (v_subst_9 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_9) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_9) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse40 (store |c_#memory_int| v_subst_9 v_ArrVal_969))) (store .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_9 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2))))) .cse12))) is different from false [2022-12-13 14:33:47,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:47,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2022-12-13 14:33:47,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:33:47,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:33:47,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:47,036 INFO L350 Elim1Store]: Elim1 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 67 treesize of output 65 [2022-12-13 14:33:47,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:47,076 INFO L350 Elim1Store]: Elim1 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 83 treesize of output 73 [2022-12-13 14:33:47,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:47,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 14:33:47,113 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-12-13 14:33:47,119 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-12-13 14:33:47,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:33:47,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2022-12-13 14:33:47,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:33:47,144 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 14:33:47,145 INFO L350 Elim1Store]: Elim1 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 1109 treesize of output 1062 [2022-12-13 14:33:47,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:33:47,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:33:47,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1107 treesize of output 1059 [2022-12-13 14:33:47,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:33:47,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 507 [2022-12-13 14:33:47,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:33:47,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1043 treesize of output 1015 [2022-12-13 14:33:47,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:33:47,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1023 treesize of output 921 [2022-12-13 14:33:47,285 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-12-13 14:33:47,291 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-12-13 14:33:47,297 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-12-13 14:33:47,304 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-12-13 14:33:47,311 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-12-13 14:33:47,318 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-12-13 14:33:47,324 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-12-13 14:33:47,332 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-12-13 14:33:47,340 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-12-13 14:33:47,346 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-12-13 14:33:47,354 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 14:33:47,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-12-13 14:33:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 13 not checked. [2022-12-13 14:33:47,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834922911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:33:47,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:33:47,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 44 [2022-12-13 14:33:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605705005] [2022-12-13 14:33:47,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:33:47,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-13 14:33:47,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:47,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-13 14:33:47,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1477, Unknown=41, NotChecked=240, Total=1892 [2022-12-13 14:33:47,478 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 44 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 44 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-12-13 14:33:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:57,378 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-12-13 14:33:57,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 14:33:57,378 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 44 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) Word has length 39 [2022-12-13 14:33:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:57,379 INFO L225 Difference]: With dead ends: 93 [2022-12-13 14:33:57,379 INFO L226 Difference]: Without dead ends: 93 [2022-12-13 14:33:57,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=599, Invalid=3274, Unknown=45, NotChecked=372, Total=4290 [2022-12-13 14:33:57,380 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 389 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 29 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:57,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 330 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 943 Invalid, 29 Unknown, 201 Unchecked, 1.1s Time] [2022-12-13 14:33:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-13 14:33:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2022-12-13 14:33:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.234375) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-12-13 14:33:57,382 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 39 [2022-12-13 14:33:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:57,382 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-12-13 14:33:57,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 44 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-12-13 14:33:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-12-13 14:33:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 14:33:57,383 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:57,383 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:57,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 14:33:57,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 14:33:57,584 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1852999400, now seen corresponding path program 1 times [2022-12-13 14:33:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:57,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142085413] [2022-12-13 14:33:57,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:57,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:58,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:58,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142085413] [2022-12-13 14:33:58,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142085413] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:33:58,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951272350] [2022-12-13 14:33:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:58,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:33:58,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:33:58,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:33:58,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 14:33:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:58,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 14:33:58,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:33:58,142 INFO L350 Elim1Store]: Elim1 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-12-13 14:33:58,176 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 14:33:58,176 INFO L350 Elim1Store]: Elim1 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-12-13 14:33:58,195 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:33:58,195 INFO L350 Elim1Store]: Elim1 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-12-13 14:33:58,229 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 14:33:58,229 INFO L350 Elim1Store]: Elim1 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-12-13 14:33:58,284 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 14:33:58,284 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-12-13 14:33:58,309 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-12-13 14:33:58,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:58,336 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 21 [2022-12-13 14:33:58,378 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 19 [2022-12-13 14:33:58,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:33:58,477 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:33:58,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 34 [2022-12-13 14:33:58,490 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-12-13 14:33:58,490 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 21 [2022-12-13 14:33:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:58,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:33:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 14:33:58,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951272350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:33:58,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:33:58,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 32 [2022-12-13 14:33:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143250002] [2022-12-13 14:33:58,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:33:58,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 14:33:58,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:58,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 14:33:58,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2022-12-13 14:33:58,791 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 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-12-13 14:33:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:59,236 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-12-13 14:33:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 14:33:59,236 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 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 40 [2022-12-13 14:33:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:33:59,236 INFO L225 Difference]: With dead ends: 83 [2022-12-13 14:33:59,236 INFO L226 Difference]: Without dead ends: 83 [2022-12-13 14:33:59,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2022-12-13 14:33:59,237 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 281 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:33:59,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 362 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:33:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-13 14:33:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2022-12-13 14:33:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:33:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-12-13 14:33:59,239 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 40 [2022-12-13 14:33:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:33:59,239 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-12-13 14:33:59,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 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-12-13 14:33:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-12-13 14:33:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 14:33:59,240 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:33:59,240 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:33:59,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 14:33:59,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:33:59,440 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:33:59,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:59,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2022-12-13 14:33:59,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:59,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428324423] [2022-12-13 14:33:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:59,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:34:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 14:34:00,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:34:00,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428324423] [2022-12-13 14:34:00,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428324423] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:34:00,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901911266] [2022-12-13 14:34:00,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 14:34:00,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:34:00,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:34:00,583 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:34:00,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 14:34:00,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 14:34:00,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:34:00,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-13 14:34:00,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:34:00,743 INFO L350 Elim1Store]: Elim1 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-12-13 14:34:00,761 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 14:34:00,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 14:34:00,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:34:00,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:00,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-12-13 14:34:00,861 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 14:34:00,861 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 34 [2022-12-13 14:34:00,919 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 14:34:00,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-12-13 14:34:00,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:34:00,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:00,978 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:34:00,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2022-12-13 14:34:00,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:00,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 14:34:01,076 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-12-13 14:34:01,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 50 [2022-12-13 14:34:01,087 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:34:01,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 14:34:01,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:01,439 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 14:34:01,439 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 85 [2022-12-13 14:34:01,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:01,446 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-12-13 14:34:01,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 72 [2022-12-13 14:34:01,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:34:01,526 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 82 [2022-12-13 14:34:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:01,967 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 14:34:01,968 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 59 treesize of output 54 [2022-12-13 14:34:01,986 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-13 14:34:01,987 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2022-12-13 14:34:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:34:02,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:34:16,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:34:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:34:20,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901911266] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:34:20,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:34:20,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 53 [2022-12-13 14:34:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053212860] [2022-12-13 14:34:20,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:34:20,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-13 14:34:20,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:34:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 14:34:20,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2687, Unknown=4, NotChecked=0, Total=2862 [2022-12-13 14:34:20,938 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 54 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:34:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:34:30,087 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-12-13 14:34:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 14:34:30,087 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-12-13 14:34:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:34:30,088 INFO L225 Difference]: With dead ends: 109 [2022-12-13 14:34:30,088 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 14:34:30,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=1058, Invalid=5910, Unknown=4, NotChecked=0, Total=6972 [2022-12-13 14:34:30,089 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1063 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 14:34:30,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 438 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 14:34:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 14:34:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2022-12-13 14:34:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.253968253968254) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:34:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-12-13 14:34:30,091 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 43 [2022-12-13 14:34:30,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:34:30,091 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-12-13 14:34:30,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:34:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-12-13 14:34:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 14:34:30,091 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:34:30,092 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:34:30,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 14:34:30,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 14:34:30,293 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:34:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:34:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728483, now seen corresponding path program 2 times [2022-12-13 14:34:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:34:30,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208281122] [2022-12-13 14:34:30,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:34:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:34:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:34:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:34:31,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:34:31,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208281122] [2022-12-13 14:34:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208281122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:34:31,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447592658] [2022-12-13 14:34:31,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 14:34:31,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:34:31,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:34:31,745 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:34:31,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 14:34:31,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 14:34:31,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:34:31,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 102 conjunts are in the unsatisfiable core [2022-12-13 14:34:31,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:34:31,864 INFO L350 Elim1Store]: Elim1 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-12-13 14:34:31,958 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 14:34:31,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 14:34:31,967 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 14:34:31,968 INFO L350 Elim1Store]: Elim1 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-12-13 14:34:32,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:34:32,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:34:32,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:32,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 14:34:32,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:32,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-12-13 14:34:32,123 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 14:34:32,124 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 16 treesize of output 26 [2022-12-13 14:34:32,208 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 14:34:32,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2022-12-13 14:34:32,219 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-13 14:34:32,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 14:34:32,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:32,349 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:34:32,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 66 [2022-12-13 14:34:32,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:32,357 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 14:34:32,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 14:34:32,580 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-12-13 14:34:32,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 80 [2022-12-13 14:34:32,605 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 14:34:32,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2022-12-13 14:34:33,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:33,343 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2022-12-13 14:34:33,344 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 151 [2022-12-13 14:34:33,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:33,352 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-12-13 14:34:33,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 115 [2022-12-13 14:34:34,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:34:34,038 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 14:34:34,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 76 [2022-12-13 14:34:34,062 INFO L321 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2022-12-13 14:34:34,062 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 100 [2022-12-13 14:34:34,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:34:34,194 INFO L321 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2022-12-13 14:34:34,195 INFO L350 Elim1Store]: Elim1 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 94 [2022-12-13 14:34:34,217 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-12-13 14:34:34,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 66 [2022-12-13 14:34:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:34:34,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:34:44,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:34:45,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:34:55,366 INFO L350 Elim1Store]: Elim1 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 281 treesize of output 273 [2022-12-13 14:34:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:34:55,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447592658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:34:55,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:34:55,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 59 [2022-12-13 14:34:55,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17204825] [2022-12-13 14:34:55,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:34:55,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-12-13 14:34:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:34:55,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-13 14:34:55,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3302, Unknown=2, NotChecked=0, Total=3540 [2022-12-13 14:34:55,610 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 60 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 60 states have internal predecessors, (117), 0 states have call successors, (0), 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-12-13 14:35:37,105 WARN L233 SmtUtils]: Spent 28.41s on a formula simplification. DAG size of input: 335 DAG size of output: 174 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 14:35:39,720 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse5 (select .cse14 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse37 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse39 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse1 (select .cse37 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse15 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse34 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse5)) (.cse57 (select (select |c_#memory_$Pointer$.base| .cse5) 0))) (let ((.cse10 (= (select (select |c_#memory_$Pointer$.offset| .cse5) 0) 0)) (.cse9 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse57)) (.cse11 (not .cse34)) (.cse12 (<= 8 (select |c_#length| .cse57))) (.cse13 (not (= .cse5 .cse57))) (.cse33 (<= 8 .cse15)) (.cse35 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) (.cse4 (<= 8 (select |c_#length| .cse5))) (.cse7 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse22 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8)) (.cse27 (not (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse21 (not (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (.cse16 (+ 8 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse38 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse42 (select |c_#length| .cse1)) (.cse2 (select .cse39 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (and (or (and (or (and (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= 8 (select |c_#length| .cse0)))) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1)) (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse3) (or .cse3 (and (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (and (or .cse4 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse5)) .cse6) .cse7) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse8 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select .cse14 0)))) (or (and (exists ((v_arrayElimCell_110 Int)) (and (<= 8 (select |c_#length| v_arrayElimCell_110)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_arrayElimCell_110)))) .cse8) (and .cse9 .cse10 .cse11) (and (exists ((v_arrayElimIndex_11 Int)) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_11) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_arrayElimIndex_11)) (= (select (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_11) 0) 0))) .cse8) (and (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) .cse12 .cse13 .cse10))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= .cse15 8) .cse10 (or (and (forall ((v_ArrVal_1546 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (let ((.cse17 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1546))) (or (not (<= .cse16 (select .cse17 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1561 Int)) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1561)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_1562 Int)) (<= (+ .cse18 8) (select .cse17 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1562)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (= .cse18 0))))))) (not (<= v_ArrVal_1546 8)))) (forall ((v_ArrVal_1546 Int)) (or (not (<= v_ArrVal_1546 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (or (not (<= .cse16 (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1546) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1561 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1561)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))))))) (forall ((v_ArrVal_1546 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (let ((.cse19 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1546))) (or (not (<= .cse16 (select .cse19 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1562 Int)) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1562)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_1561 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1561)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select .cse19 .cse20))) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| .cse20))))))) (not (<= v_ArrVal_1546 8))))) .cse21) (or (and (forall ((v_ArrVal_1546 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (or (not (<= .cse22 (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1546) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1561 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1561)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))))) (not (<= v_ArrVal_1546 8)))) (forall ((v_ArrVal_1546 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (let ((.cse24 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1546))) (or (forall ((v_ArrVal_1561 Int)) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1561)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse23 0) (forall ((v_ArrVal_1562 Int)) (<= (+ .cse23 8) (select .cse24 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1562)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (not (<= .cse22 (select .cse24 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) (not (<= v_ArrVal_1546 8)))) (forall ((v_ArrVal_1546 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (let ((.cse26 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1546))) (or (forall ((v_ArrVal_1562 Int)) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1562)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| .cse25) (forall ((v_ArrVal_1561 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1561)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select .cse26 .cse25)))))) (not (<= .cse22 (select .cse26 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) (not (<= v_ArrVal_1546 8))))) .cse27) (let ((.cse32 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse30 (select .cse32 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (let ((.cse28 (select (select |c_#memory_$Pointer$.base| .cse30) 0)) (.cse29 (= 0 (select (select |c_#memory_$Pointer$.offset| .cse30) 0))) (.cse31 (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select .cse32 0)))) (or (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse28) .cse29 (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse30))) (and (<= 8 (select |c_#length| .cse28)) (not (= .cse30 .cse28)) .cse29 (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|)))) (and (exists ((v_arrayElimIndex_11 Int)) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_11) 0)) (= (select (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_11) 0) 0) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_arrayElimIndex_11)))) .cse31) (and (exists ((v_arrayElimCell_110 Int)) (and (<= 8 (select |c_#length| v_arrayElimCell_110)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_arrayElimCell_110)))) .cse31))))) .cse33 .cse6 (or (and .cse34 (exists ((v_arrayElimCell_110 Int)) (and (<= 8 (select |c_#length| v_arrayElimCell_110)) (not (= v_arrayElimCell_110 .cse5))))) (and .cse9 .cse11) (and .cse12 .cse13)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) .cse35 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (or (and (forall ((v_ArrVal_1561 Int)) (let ((.cse36 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse39 .cse38 v_ArrVal_1561)) .cse1) .cse2))) (or (= .cse36 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_1562 Int)) (<= (+ .cse36 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse37 .cse38 v_ArrVal_1562)) .cse1) .cse2))))))) (forall ((v_ArrVal_1562 Int)) (let ((.cse40 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse37 .cse38 v_ArrVal_1562)) .cse1) .cse2))) (or (forall ((v_ArrVal_1561 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse39 .cse38 v_ArrVal_1561)) .cse1) .cse2) 8) (select |c_#length| .cse40))) (= .cse40 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (or (forall ((v_ArrVal_1561 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse39 .cse38 v_ArrVal_1561)) .cse1) .cse2) 4))) (forall ((v_ArrVal_1562 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse37 .cse38 v_ArrVal_1562)) .cse1) .cse2) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1561 Int)) (let ((.cse41 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse39 .cse38 v_ArrVal_1561)) .cse1) .cse2))) (or (= .cse41 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= 0 (+ .cse41 4)))))) (not (<= (+ .cse2 8) .cse42)) (not (<= 0 .cse2))) (or .cse3 (and .cse33 .cse35)) (or (and .cse6 .cse4) .cse7) (or (let ((.cse45 (store .cse39 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse44 (store .cse37 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (forall ((v_ArrVal_1561 Int)) (let ((.cse43 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse45 .cse38 v_ArrVal_1561)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse43 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_1562 Int)) (<= (+ .cse43 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse44 .cse38 v_ArrVal_1562)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_1561 Int)) (let ((.cse46 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse45 .cse38 v_ArrVal_1561)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse46 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= 0 (+ .cse46 4))))) (or (forall ((v_ArrVal_1561 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse45 .cse38 v_ArrVal_1561)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_1562 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse44 .cse38 v_ArrVal_1562)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1562 Int)) (let ((.cse47 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse44 .cse38 v_ArrVal_1562)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_1561 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse45 .cse38 v_ArrVal_1561)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| .cse47))) (= .cse47 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) (not (<= .cse22 .cse15)) .cse27) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (or .cse21 (and (forall ((v_ArrVal_1545 Int) (v_ArrVal_1544 Int) (v_ArrVal_1546 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (let ((.cse48 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1546))) (or (not (<= .cse16 (select .cse48 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1562 Int)) (let ((.cse50 (select (select (let ((.cse51 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse37 .cse38 v_ArrVal_1544)))) (store .cse51 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select .cse51 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1562))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_1561 Int)) (<= (+ (select (select (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse39 .cse38 v_ArrVal_1545)))) (store .cse49 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select .cse49 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1561))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select .cse48 .cse50))) (= .cse50 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|))))))) (not (<= v_ArrVal_1546 8)))) (forall ((v_ArrVal_1545 Int) (v_ArrVal_1544 Int) (v_ArrVal_1546 Int)) (or (not (<= v_ArrVal_1546 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (let ((.cse52 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1546))) (or (not (<= .cse16 (select .cse52 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1561 Int)) (let ((.cse53 (select (select (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse39 .cse38 v_ArrVal_1545)))) (store .cse55 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select .cse55 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1561))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse53 0) (forall ((v_ArrVal_1562 Int)) (<= (+ .cse53 8) (select .cse52 (select (select (let ((.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse37 .cse38 v_ArrVal_1544)))) (store .cse54 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select .cse54 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1562))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))))))) (forall ((v_ArrVal_1545 Int) (v_ArrVal_1546 Int)) (or (not (<= v_ArrVal_1546 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (or (not (<= .cse16 (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1546) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1561 Int)) (<= 0 (+ (select (select (let ((.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse39 .cse38 v_ArrVal_1545)))) (store .cse56 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (store (select .cse56 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1561))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))))))))) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 8) (or (and (<= 8 .cse42) (= .cse2 0)) .cse3) (<= (select |c_#length| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 8) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) is different from true [2022-12-13 14:35:42,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 14:35:44,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 14:35:46,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 14:35:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:35:49,653 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-12-13 14:35:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 14:35:49,653 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 60 states have internal predecessors, (117), 0 states have call successors, (0), 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 43 [2022-12-13 14:35:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:35:49,654 INFO L225 Difference]: With dead ends: 103 [2022-12-13 14:35:49,654 INFO L226 Difference]: Without dead ends: 103 [2022-12-13 14:35:49,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2135 ImplicationChecksByTransitivity, 66.0s TimeCoverageRelationStatistics Valid=694, Invalid=6616, Unknown=4, NotChecked=168, Total=7482 [2022-12-13 14:35:49,656 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 291 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 95 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-12-13 14:35:49,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 487 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1501 Invalid, 3 Unknown, 1 Unchecked, 9.7s Time] [2022-12-13 14:35:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-13 14:35:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2022-12-13 14:35:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 79 states have internal predecessors, (87), 0 states have call successors, (0), 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-12-13 14:35:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-12-13 14:35:49,658 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 43 [2022-12-13 14:35:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:35:49,658 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-12-13 14:35:49,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 60 states have internal predecessors, (117), 0 states have call successors, (0), 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-12-13 14:35:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-12-13 14:35:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 14:35:49,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:35:49,659 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:35:49,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 14:35:49,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:35:49,861 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:35:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash 972990722, now seen corresponding path program 1 times [2022-12-13 14:35:49,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:49,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939932693] [2022-12-13 14:35:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 14:35:50,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:50,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939932693] [2022-12-13 14:35:50,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939932693] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:35:50,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792598674] [2022-12-13 14:35:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:50,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:35:50,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:35:50,070 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:35:50,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 14:35:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:50,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 14:35:50,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:35:50,179 INFO L350 Elim1Store]: Elim1 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-12-13 14:35:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 14:35:50,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:35:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 14:35:50,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792598674] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 14:35:50,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 14:35:50,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 19 [2022-12-13 14:35:50,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869973421] [2022-12-13 14:35:50,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:50,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:35:50,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:50,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:35:50,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-12-13 14:35:50,470 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:35:50,726 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-12-13 14:35:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:35:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-12-13 14:35:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:35:50,727 INFO L225 Difference]: With dead ends: 82 [2022-12-13 14:35:50,727 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 14:35:50,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2022-12-13 14:35:50,728 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 172 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:35:50,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 37 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:35:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 14:35:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-12-13 14:35:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2022-12-13 14:35:50,729 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 44 [2022-12-13 14:35:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:35:50,729 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2022-12-13 14:35:50,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2022-12-13 14:35:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 14:35:50,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:35:50,730 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:35:50,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 14:35:50,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:35:50,932 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-12-13 14:35:50,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:50,933 INFO L85 PathProgramCache]: Analyzing trace with hash 97977167, now seen corresponding path program 2 times [2022-12-13 14:35:50,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:50,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495596026] [2022-12-13 14:35:50,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:35:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:53,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495596026] [2022-12-13 14:35:53,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495596026] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:35:53,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53810609] [2022-12-13 14:35:53,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 14:35:53,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:35:53,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:35:53,415 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:35:53,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f791c83b-d981-43b0-9a9a-2157bbd1eae7/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 14:35:53,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 14:35:53,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:35:53,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 123 conjunts are in the unsatisfiable core [2022-12-13 14:35:53,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:35:53,566 INFO L350 Elim1Store]: Elim1 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-12-13 14:35:53,649 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 14:35:53,650 INFO L350 Elim1Store]: Elim1 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-12-13 14:35:53,688 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 14:35:53,688 INFO L350 Elim1Store]: Elim1 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-12-13 14:35:53,767 INFO L350 Elim1Store]: Elim1 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-12-13 14:35:53,903 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 14:35:53,903 INFO L350 Elim1Store]: Elim1 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-12-13 14:35:53,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:35:53,991 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-12-13 14:35:53,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 14:35:54,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:35:54,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 14:35:54,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:35:54,083 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 32 [2022-12-13 14:35:54,087 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-12-13 14:35:54,290 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 14:35:54,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2022-12-13 14:35:54,308 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 14:35:54,309 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 14:35:54,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 14:35:54,351 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-13 14:35:54,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 14:35:54,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:35:54,496 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 14:35:54,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 86 [2022-12-13 14:35:54,524 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-12-13 14:35:54,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 140 [2022-12-13 14:35:54,603 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 14:35:54,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:35:54,643 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 14:35:54,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 14:35:54,990 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 14:35:54,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 88 [2022-12-13 14:35:55,009 INFO L321 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2022-12-13 14:35:55,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 80 [2022-12-13 14:35:55,022 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 14:35:55,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2022-12-13 14:35:56,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:35:56,134 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-12-13 14:35:56,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 228 treesize of output 181 [2022-12-13 14:35:56,190 INFO L321 Elim1Store]: treesize reduction 54, result has 64.9 percent of original size [2022-12-13 14:35:56,190 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 301 [2022-12-13 14:35:56,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:35:56,206 INFO L321 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2022-12-13 14:35:56,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 217 treesize of output 223 [2022-12-13 14:35:57,923 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 14:35:59,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 14:35:59,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 14:35:59,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 14:36:00,044 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 14:36:00,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 14:36:02,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:36:02,890 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-12-13 14:36:02,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 144 treesize of output 107 [2022-12-13 14:36:02,907 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-13 14:36:02,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 96 [2022-12-13 14:36:02,933 INFO L321 Elim1Store]: treesize reduction 116, result has 15.9 percent of original size [2022-12-13 14:36:02,933 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 115 [2022-12-13 14:36:03,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:36:03,118 INFO L321 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2022-12-13 14:36:03,118 INFO L350 Elim1Store]: Elim1 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 14 case distinctions, treesize of input 162 treesize of output 131 [2022-12-13 14:36:03,157 INFO L321 Elim1Store]: treesize reduction 29, result has 60.3 percent of original size [2022-12-13 14:36:03,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 100 [2022-12-13 14:36:03,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:36:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 14:36:03,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:36:36,352 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1943)))) (store .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1944)))) (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse3 (select .cse2 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse6 (select .cse5 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse6 0)) (.cse4 (select .cse3 0))) (let ((.cse0 (select (select (store .cse5 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 4 v_ArrVal_1953)) .cse1) .cse4))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1954) .cse1 v_ArrVal_1957) .cse0) (+ (select (select (store .cse2 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 4 v_ArrVal_1951)) .cse1) .cse4) 4))))))))) (forall ((v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse11 (let ((.cse17 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1943)))) (store .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse14 (let ((.cse16 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1944)))) (store .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse15 (select .cse14 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse12 (select .cse11 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse10 (select .cse12 0)) (.cse13 (select .cse15 0))) (let ((.cse9 (select (select (store .cse14 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse15 4 v_ArrVal_1951)) .cse10) .cse13))) (or (= .cse9 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1954) .cse10 v_ArrVal_1957) (select (select (store .cse11 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse12 4 v_ArrVal_1953)) .cse10) .cse13)) (+ .cse9 4)))))))))) is different from false [2022-12-13 14:36:38,402 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1954 (Array Int Int)) (v_subst_24 Int) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.base| v_subst_24 (store (store (select |c_#memory_$Pointer$.base| v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1943)))) (store .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_24)))) (.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.offset| v_subst_24 (store (store (select |c_#memory_$Pointer$.offset| v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1944)))) (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse3 (select .cse2 v_subst_24)) (.cse6 (select .cse5 v_subst_24))) (let ((.cse1 (select .cse6 0)) (.cse4 (select .cse3 0))) (let ((.cse0 (select (select (store .cse5 v_subst_24 (store .cse6 4 v_ArrVal_1953)) .cse1) .cse4))) (or (= .cse0 v_subst_24) (= (select (select (store (store (store (store |c_#memory_int| v_subst_24 v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) v_subst_24 v_ArrVal_1954) .cse1 v_ArrVal_1957) .cse0) (+ 4 (select (select (store .cse2 v_subst_24 (store .cse3 4 v_ArrVal_1951)) .cse1) .cse4))) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (forall ((v_ArrVal_1954 (Array Int Int)) (v_subst_23 Int) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse10 (let ((.cse17 (store |c_#memory_$Pointer$.base| v_subst_23 (store (store (select |c_#memory_$Pointer$.base| v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1943)))) (store .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_23)))) (.cse14 (let ((.cse16 (store |c_#memory_$Pointer$.offset| v_subst_23 (store (store (select |c_#memory_$Pointer$.offset| v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1944)))) (store .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse15 (select .cse14 v_subst_23)) (.cse11 (select .cse10 v_subst_23))) (let ((.cse9 (select .cse11 0)) (.cse12 (select .cse15 0))) (let ((.cse13 (select (select (store .cse14 v_subst_23 (store .cse15 4 v_ArrVal_1951)) .cse9) .cse12))) (or (= (select (select (store (store (store (store |c_#memory_int| v_subst_23 v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) v_subst_23 v_ArrVal_1954) .cse9 v_ArrVal_1957) (select (select (store .cse10 v_subst_23 (store .cse11 4 v_ArrVal_1953)) .cse9) .cse12)) (+ .cse13 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse13 0)))))))) is different from false [2022-12-13 14:36:42,587 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse10 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1954 (Array Int Int)) (v_subst_23 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1932 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1934 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse2 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1932)))) (store .cse12 v_subst_23 (store (store (select .cse12 v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1943))))) (store .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_23)))) (.cse5 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1934)))) (store .cse8 v_subst_23 (store (store (select .cse8 v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1944))))) (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse6 (select .cse5 v_subst_23)) (.cse3 (select .cse2 v_subst_23))) (let ((.cse1 (select .cse3 0)) (.cse4 (select .cse6 0))) (let ((.cse0 (select (select (store .cse5 v_subst_23 (store .cse6 4 v_ArrVal_1951)) .cse1) .cse4))) (or (= .cse0 0) (= (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1930) v_subst_23 v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) v_subst_23 v_ArrVal_1954) .cse1 v_ArrVal_1957) (select (select (store .cse2 v_subst_23 (store .cse3 4 v_ArrVal_1953)) .cse1) .cse4)) (+ .cse0 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (forall ((v_ArrVal_1954 (Array Int Int)) (v_subst_24 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1932 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1934 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse19 (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1932)))) (store .cse24 v_subst_24 (store (store (select .cse24 v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1943))))) (store .cse23 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_24)))) (.cse16 (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1934)))) (store .cse22 v_subst_24 (store (store (select .cse22 v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1944))))) (store .cse21 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse17 (select .cse16 v_subst_24)) (.cse20 (select .cse19 v_subst_24))) (let ((.cse14 (select .cse20 0)) (.cse18 (select .cse17 0))) (let ((.cse15 (select (select (store .cse19 v_subst_24 (store .cse20 4 v_ArrVal_1953)) .cse14) .cse18))) (or (= (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1930) v_subst_24 v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) v_subst_24 v_ArrVal_1954) .cse14 v_ArrVal_1957) .cse15) (+ (select (select (store .cse16 v_subst_24 (store .cse17 4 v_ArrVal_1951)) .cse14) .cse18) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_24 .cse15))))))))) is different from false [2022-12-13 14:36:42,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:36:42,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 488571 treesize of output 485699 [2022-12-13 14:36:46,550 INFO L321 Elim1Store]: treesize reduction 297, result has 32.0 percent of original size [2022-12-13 14:36:46,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 9708667 treesize of output 9601286 [2022-12-13 14:43:07,385 WARN L233 SmtUtils]: Spent 6.35m on a formula simplification. DAG size of input: 2228 DAG size of output: 2225 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:43:08,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:08,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9562605 treesize of output 9561591 [2022-12-13 14:43:28,806 WARN L233 SmtUtils]: Spent 20.74s on a formula simplification that was a NOOP. DAG size: 2233 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:43:29,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 14:43:30,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:43:30,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:30,474 INFO L350 Elim1Store]: Elim1 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 90 treesize of output 98 [2022-12-13 14:43:30,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:43:30,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:30,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 132 [2022-12-13 14:43:55,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:43:55,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 9574120 treesize of output 9573142 [2022-12-13 14:44:15,580 WARN L233 SmtUtils]: Spent 20.16s on a formula simplification that was a NOOP. DAG size: 2126 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:44:35,757 WARN L233 SmtUtils]: Spent 20.17s on a formula simplification that was a NOOP. DAG size: 2123 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:45:48,974 WARN L233 SmtUtils]: Spent 39.97s on a formula simplification that was a NOOP. DAG size: 2069 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 14:47:29,144 WARN L233 SmtUtils]: Spent 1.33m on a formula simplification that was a NOOP. DAG size: 2073 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)