./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 8393723b 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_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/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_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 19:46:55,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:46:55,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:46:55,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:46:55,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:46:55,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:46:55,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:46:55,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:46:55,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:46:55,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:46:55,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:46:55,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:46:55,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:46:55,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:46:55,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:46:55,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:46:55,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:46:55,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:46:55,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:46:55,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:46:55,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:46:55,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:46:55,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:46:55,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:46:55,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:46:55,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:46:55,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:46:55,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:46:55,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:46:55,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:46:55,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:46:55,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:46:55,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:46:55,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:46:55,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:46:55,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:46:55,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:46:55,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:46:55,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:46:55,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:46:55,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:46:55,187 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 19:46:55,207 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:46:55,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:46:55,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:46:55,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:46:55,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:46:55,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:46:55,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:46:55,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:46:55,211 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:46:55,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:46:55,212 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:46:55,212 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:46:55,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:46:55,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:46:55,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:46:55,213 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:46:55,213 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:46:55,214 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:46:55,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:46:55,214 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:46:55,214 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:46:55,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:46:55,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:46:55,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:46:55,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:46:55,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:46:55,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:46:55,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:46:55,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:46:55,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:46:55,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/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_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro 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-11-18 19:46:55,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:46:55,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:46:55,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:46:55,527 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:46:55,528 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:46:55,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-11-18 19:46:55,608 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/data/9fdf7b6d9/decdd76ac402425aa4a4c90f703431d8/FLAG0210ed851 [2022-11-18 19:46:56,116 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:46:56,117 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-11-18 19:46:56,142 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/data/9fdf7b6d9/decdd76ac402425aa4a4c90f703431d8/FLAG0210ed851 [2022-11-18 19:46:56,439 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/data/9fdf7b6d9/decdd76ac402425aa4a4c90f703431d8 [2022-11-18 19:46:56,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:46:56,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:46:56,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:46:56,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:46:56,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:46:56,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:56,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac4420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56, skipping insertion in model container [2022-11-18 19:46:56,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:56,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:46:56,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:46:56,835 WARN L234 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_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2022-11-18 19:46:56,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:46:56,846 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:46:56,914 WARN L234 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_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2022-11-18 19:46:56,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:46:56,959 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:46:56,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56 WrapperNode [2022-11-18 19:46:56,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:46:56,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:46:56,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:46:56,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:46:56,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,041 INFO L138 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-11-18 19:46:57,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:46:57,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:46:57,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:46:57,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:46:57,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,084 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:46:57,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:46:57,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:46:57,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:46:57,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (1/1) ... [2022-11-18 19:46:57,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:46:57,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:46:57,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:46:57,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:46:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-18 19:46:57,187 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-18 19:46:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:46:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:46:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:46:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:46:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:46:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:46:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:46:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:46:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:46:57,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:46:57,305 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:46:57,307 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:46:57,350 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-18 19:46:57,661 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:46:57,668 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:46:57,669 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 19:46:57,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:46:57 BoogieIcfgContainer [2022-11-18 19:46:57,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:46:57,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:46:57,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:46:57,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:46:57,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:46:56" (1/3) ... [2022-11-18 19:46:57,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c271565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:46:57, skipping insertion in model container [2022-11-18 19:46:57,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:56" (2/3) ... [2022-11-18 19:46:57,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c271565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:46:57, skipping insertion in model container [2022-11-18 19:46:57,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:46:57" (3/3) ... [2022-11-18 19:46:57,690 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2022-11-18 19:46:57,711 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:46:57,712 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-11-18 19:46:57,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:46:57,770 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c2e0d68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:46:57,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-18 19:46:57,775 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-11-18 19:46:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 19:46:57,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:46:57,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 19:46:57,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-18 19:46:57,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-11-18 19:46:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:57,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904976840] [2022-11-18 19:46:57,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:46:58,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:58,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904976840] [2022-11-18 19:46:58,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904976840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:58,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:58,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:46:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622781152] [2022-11-18 19:46:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:58,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:46:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:46:58,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:58,076 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-11-18 19:46:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:46:58,169 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-18 19:46:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:46:58,172 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-11-18 19:46:58,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:46:58,178 INFO L225 Difference]: With dead ends: 76 [2022-11-18 19:46:58,179 INFO L226 Difference]: Without dead ends: 70 [2022-11-18 19:46:58,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:58,184 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:46:58,185 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.1s Time] [2022-11-18 19:46:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-18 19:46:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2022-11-18 19:46:58,216 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-11-18 19:46:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-18 19:46:58,218 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2022-11-18 19:46:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:46:58,219 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-18 19:46:58,219 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-11-18 19:46:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-18 19:46:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 19:46:58,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:46:58,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 19:46:58,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:46:58,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-18 19:46:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:58,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-11-18 19:46:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:58,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212139339] [2022-11-18 19:46:58,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:58,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:46:58,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:58,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212139339] [2022-11-18 19:46:58,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212139339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:58,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:58,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:46:58,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524997631] [2022-11-18 19:46:58,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:58,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:46:58,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:46:58,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:58,399 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-11-18 19:46:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:46:58,485 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-11-18 19:46:58,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:46:58,487 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-11-18 19:46:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:46:58,488 INFO L225 Difference]: With dead ends: 51 [2022-11-18 19:46:58,488 INFO L226 Difference]: Without dead ends: 51 [2022-11-18 19:46:58,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:58,490 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:46:58,491 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.1s Time] [2022-11-18 19:46:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-18 19:46:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-18 19:46:58,495 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-11-18 19:46:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-11-18 19:46:58,496 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2022-11-18 19:46:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:46:58,497 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-11-18 19:46:58,497 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-11-18 19:46:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-11-18 19:46:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 19:46:58,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:46:58,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:46:58,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:46:58,499 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-11-18 19:46:58,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-11-18 19:46:58,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:58,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062106704] [2022-11-18 19:46:58,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:58,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:46:58,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:58,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062106704] [2022-11-18 19:46:58,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062106704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:58,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:58,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:46:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147324064] [2022-11-18 19:46:58,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:58,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:46:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:58,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:46:58,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:58,616 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-11-18 19:46:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:46:58,691 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-18 19:46:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:46:58,692 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-11-18 19:46:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:46:58,693 INFO L225 Difference]: With dead ends: 82 [2022-11-18 19:46:58,693 INFO L226 Difference]: Without dead ends: 82 [2022-11-18 19:46:58,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:58,695 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:46:58,696 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.1s Time] [2022-11-18 19:46:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-18 19:46:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2022-11-18 19:46:58,705 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-11-18 19:46:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-11-18 19:46:58,712 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2022-11-18 19:46:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:46:58,713 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-11-18 19:46:58,713 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-11-18 19:46:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-11-18 19:46:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 19:46:58,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:46:58,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:46:58,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:46:58,715 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-11-18 19:46:58,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:58,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-11-18 19:46:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:58,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450022647] [2022-11-18 19:46:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:58,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:46:58,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:58,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450022647] [2022-11-18 19:46:58,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450022647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:58,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:58,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:46:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430143066] [2022-11-18 19:46:58,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:58,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:46:58,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:58,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:46:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:58,956 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-11-18 19:46:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:46:59,025 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-11-18 19:46:59,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:46:59,026 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-11-18 19:46:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:46:59,027 INFO L225 Difference]: With dead ends: 84 [2022-11-18 19:46:59,027 INFO L226 Difference]: Without dead ends: 84 [2022-11-18 19:46:59,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:59,029 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:46:59,029 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.1s Time] [2022-11-18 19:46:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-18 19:46:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2022-11-18 19:46:59,034 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-11-18 19:46:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-11-18 19:46:59,035 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2022-11-18 19:46:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:46:59,035 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-11-18 19:46:59,036 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-11-18 19:46:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-11-18 19:46:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:46:59,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:46:59,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:46:59,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:46:59,037 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-11-18 19:46:59,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2022-11-18 19:46:59,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:59,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616308677] [2022-11-18 19:46:59,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:59,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:46:59,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:59,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616308677] [2022-11-18 19:46:59,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616308677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:59,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:59,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:46:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261300681] [2022-11-18 19:46:59,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:59,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:46:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:59,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:46:59,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:59,138 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-11-18 19:46:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:46:59,157 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-11-18 19:46:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:46:59,159 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-11-18 19:46:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:46:59,160 INFO L225 Difference]: With dead ends: 52 [2022-11-18 19:46:59,160 INFO L226 Difference]: Without dead ends: 52 [2022-11-18 19:46:59,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:59,164 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-11-18 19:46:59,165 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-11-18 19:46:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-18 19:46:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-11-18 19:46:59,169 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-11-18 19:46:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-11-18 19:46:59,170 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 11 [2022-11-18 19:46:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:46:59,170 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-11-18 19:46:59,170 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-11-18 19:46:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-11-18 19:46:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:46:59,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:46:59,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:46:59,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:46:59,171 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-11-18 19:46:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2022-11-18 19:46:59,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:59,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463419167] [2022-11-18 19:46:59,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:59,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:46:59,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:59,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463419167] [2022-11-18 19:46:59,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463419167] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:46:59,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114597209] [2022-11-18 19:46:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:59,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:46:59,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:46:59,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:46:59,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:46:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:59,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:46:59,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:46:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:46:59,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:46:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:46:59,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114597209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:46:59,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:46:59,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-18 19:46:59,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259049172] [2022-11-18 19:46:59,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:46:59,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:46:59,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:59,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:46:59,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:46:59,704 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-11-18 19:46:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:46:59,738 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-11-18 19:46:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:46:59,739 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-11-18 19:46:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:46:59,743 INFO L225 Difference]: With dead ends: 63 [2022-11-18 19:46:59,743 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 19:46:59,744 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-11-18 19:46:59,751 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:46:59,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 138 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:46:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 19:46:59,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-18 19:46:59,759 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-11-18 19:46:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-11-18 19:46:59,760 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 16 [2022-11-18 19:46:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:46:59,760 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-11-18 19:46:59,761 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-11-18 19:46:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-11-18 19:46:59,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-18 19:46:59,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:46:59,762 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:46:59,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:46:59,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:46:59,963 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-11-18 19:46:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2022-11-18 19:46:59,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:59,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578465060] [2022-11-18 19:46:59,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:59,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 19:47:00,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:00,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578465060] [2022-11-18 19:47:00,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578465060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:00,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:00,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:47:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271859045] [2022-11-18 19:47:00,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:00,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:47:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:47:00,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:47:00,166 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-11-18 19:47:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:00,344 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-11-18 19:47:00,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:47:00,344 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-11-18 19:47:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:00,345 INFO L225 Difference]: With dead ends: 75 [2022-11-18 19:47:00,345 INFO L226 Difference]: Without dead ends: 75 [2022-11-18 19:47:00,346 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-11-18 19:47:00,346 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-11-18 19:47:00,347 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-11-18 19:47:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-18 19:47:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2022-11-18 19:47:00,350 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-11-18 19:47:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-11-18 19:47:00,351 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 31 [2022-11-18 19:47:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:00,351 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-11-18 19:47:00,352 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-11-18 19:47:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-11-18 19:47:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-18 19:47:00,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:00,353 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:47:00,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:47:00,353 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-11-18 19:47:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2022-11-18 19:47:00,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:00,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515923502] [2022-11-18 19:47:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:00,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:47:00,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:00,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515923502] [2022-11-18 19:47:00,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515923502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:00,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:00,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:47:00,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968549666] [2022-11-18 19:47:00,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:00,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:47:00,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:00,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:47:00,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:47:00,693 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-11-18 19:47:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:00,866 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-18 19:47:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:47:00,867 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-11-18 19:47:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:00,867 INFO L225 Difference]: With dead ends: 66 [2022-11-18 19:47:00,868 INFO L226 Difference]: Without dead ends: 66 [2022-11-18 19:47:00,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:47:00,869 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-11-18 19:47:00,869 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-11-18 19:47:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-18 19:47:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2022-11-18 19:47:00,872 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-11-18 19:47:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-11-18 19:47:00,873 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2022-11-18 19:47:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:00,873 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-11-18 19:47:00,873 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-11-18 19:47:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-11-18 19:47:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-18 19:47:00,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:00,874 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:47:00,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:47:00,875 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-11-18 19:47:00,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash 142544431, now seen corresponding path program 1 times [2022-11-18 19:47:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:00,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822371738] [2022-11-18 19:47:00,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:47:01,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:01,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822371738] [2022-11-18 19:47:01,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822371738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:47:01,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284514196] [2022-11-18 19:47:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:01,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:01,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:47:01,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:47:01,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:47:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:02,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-18 19:47:02,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:47:02,303 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-11-18 19:47:02,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:02,400 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-11-18 19:47:02,498 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-11-18 19:47:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:47:02,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:47:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:47:02,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284514196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:47:02,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:47:02,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-11-18 19:47:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345207127] [2022-11-18 19:47:02,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:47:02,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 19:47:02,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 19:47:02,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-11-18 19:47:02,923 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-11-18 19:47:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:03,266 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-11-18 19:47:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:47:03,267 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-11-18 19:47:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:03,268 INFO L225 Difference]: With dead ends: 63 [2022-11-18 19:47:03,268 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 19:47:03,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2022-11-18 19:47:03,269 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 178 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:03,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 325 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-11-18 19:47:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 19:47:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-18 19:47:03,272 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-11-18 19:47:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-11-18 19:47:03,273 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 33 [2022-11-18 19:47:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:03,273 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-11-18 19:47:03,273 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-11-18 19:47:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-11-18 19:47:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 19:47:03,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:03,274 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-11-18 19:47:03,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:47:03,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:03,484 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-11-18 19:47:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:03,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2022-11-18 19:47:03,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:03,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151180605] [2022-11-18 19:47:03,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:03,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:47:04,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:04,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151180605] [2022-11-18 19:47:04,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151180605] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:47:04,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890147860] [2022-11-18 19:47:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:04,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:04,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:47:04,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:47:04,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:47:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:05,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-18 19:47:05,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:47:05,069 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-11-18 19:47:05,124 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:47:05,124 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-11-18 19:47:05,196 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-11-18 19:47:05,204 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-11-18 19:47:05,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,263 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-11-18 19:47:05,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,274 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-11-18 19:47:05,377 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 19:47:05,377 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-11-18 19:47:05,393 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 19:47:05,393 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-11-18 19:47:05,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,781 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:47:05,781 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-11-18 19:47:05,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:05,799 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:47:05,799 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-11-18 19:47:05,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:05,854 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-11-18 19:47:05,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:05,867 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-11-18 19:47:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:47:05,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:47:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:47:06,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890147860] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:47:06,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:47:06,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 27 [2022-11-18 19:47:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579274145] [2022-11-18 19:47:06,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:47:06,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 19:47:06,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:06,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 19:47:06,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2022-11-18 19:47:06,514 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-11-18 19:47:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:07,308 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-11-18 19:47:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 19:47:07,309 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-11-18 19:47:07,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:07,310 INFO L225 Difference]: With dead ends: 90 [2022-11-18 19:47:07,310 INFO L226 Difference]: Without dead ends: 90 [2022-11-18 19:47:07,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-11-18 19:47:07,311 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 102 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:07,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 241 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 597 Invalid, 0 Unknown, 70 Unchecked, 0.5s Time] [2022-11-18 19:47:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-18 19:47:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2022-11-18 19:47:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-11-18 19:47:07,315 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 37 [2022-11-18 19:47:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:07,316 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-11-18 19:47:07,316 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-11-18 19:47:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-11-18 19:47:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 19:47:07,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:07,317 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-11-18 19:47:07,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:47:07,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 19:47:07,524 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-11-18 19:47:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:07,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2022-11-18 19:47:07,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:07,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626040643] [2022-11-18 19:47:07,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:07,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:47:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:08,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626040643] [2022-11-18 19:47:08,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626040643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:47:08,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206280740] [2022-11-18 19:47:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:08,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:08,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:47:08,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:47:08,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:47:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:08,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-18 19:47:08,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:47:09,115 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:47:09,116 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-11-18 19:47:09,187 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-11-18 19:47:09,196 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-11-18 19:47:09,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:09,256 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-11-18 19:47:09,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:09,265 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-11-18 19:47:09,366 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 19:47:09,367 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-11-18 19:47:09,382 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 19:47:09,383 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-11-18 19:47:09,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:09,767 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:47:09,768 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-11-18 19:47:09,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:09,788 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:47:09,789 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-11-18 19:47:09,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:09,835 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-11-18 19:47:09,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:09,846 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-11-18 19:47:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:47:09,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:47:10,997 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-11-18 19:47:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:47:11,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206280740] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:47:11,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:47:11,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 36 [2022-11-18 19:47:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14742280] [2022-11-18 19:47:11,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:47:11,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-18 19:47:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-18 19:47:11,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 19:47:11,043 INFO L87 Difference]: Start difference. First operand 72 states and 81 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-11-18 19:47:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:12,726 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-11-18 19:47:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 19:47:12,727 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-11-18 19:47:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:12,728 INFO L225 Difference]: With dead ends: 98 [2022-11-18 19:47:12,728 INFO L226 Difference]: Without dead ends: 98 [2022-11-18 19:47:12,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=313, Invalid=2443, Unknown=0, NotChecked=0, Total=2756 [2022-11-18 19:47:12,730 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 141 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:12,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 230 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 608 Invalid, 0 Unknown, 64 Unchecked, 0.5s Time] [2022-11-18 19:47:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-18 19:47:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2022-11-18 19:47:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.28125) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-11-18 19:47:12,734 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 37 [2022-11-18 19:47:12,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:12,734 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-11-18 19:47:12,734 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-11-18 19:47:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-11-18 19:47:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-18 19:47:12,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:12,742 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] [2022-11-18 19:47:12,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:47:12,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 19:47:12,964 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-18 19:47:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1124327535, now seen corresponding path program 1 times [2022-11-18 19:47:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:12,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414546814] [2022-11-18 19:47:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-18 19:47:13,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:13,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414546814] [2022-11-18 19:47:13,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414546814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:13,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:13,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:47:13,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855235556] [2022-11-18 19:47:13,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:13,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:47:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:13,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:47:13,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:47:13,109 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:13,190 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-18 19:47:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:47:13,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-18 19:47:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:13,192 INFO L225 Difference]: With dead ends: 89 [2022-11-18 19:47:13,192 INFO L226 Difference]: Without dead ends: 89 [2022-11-18 19:47:13,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:47:13,193 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 87 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:13,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 78 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:47:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-18 19:47:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2022-11-18 19:47:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-11-18 19:47:13,202 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 38 [2022-11-18 19:47:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:13,202 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-11-18 19:47:13,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-11-18 19:47:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-18 19:47:13,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:13,203 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] [2022-11-18 19:47:13,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:47:13,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-18 19:47:13,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1124327534, now seen corresponding path program 1 times [2022-11-18 19:47:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:13,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549287567] [2022-11-18 19:47:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:13,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:47:13,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:13,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549287567] [2022-11-18 19:47:13,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549287567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:13,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:13,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:47:13,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162225127] [2022-11-18 19:47:13,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:13,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:47:13,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:13,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:47:13,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:47:13,519 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:13,705 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-11-18 19:47:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:47:13,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-18 19:47:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:13,706 INFO L225 Difference]: With dead ends: 84 [2022-11-18 19:47:13,706 INFO L226 Difference]: Without dead ends: 84 [2022-11-18 19:47:13,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:47:13,707 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 196 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:13,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 47 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:47:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-18 19:47:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-11-18 19:47:13,709 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-11-18 19:47:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-11-18 19:47:13,710 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 38 [2022-11-18 19:47:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:13,710 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-11-18 19:47:13,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-11-18 19:47:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:47:13,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:13,711 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-11-18 19:47:13,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 19:47:13,716 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-18 19:47:13,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:13,717 INFO L85 PathProgramCache]: Analyzing trace with hash -494379329, now seen corresponding path program 1 times [2022-11-18 19:47:13,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:13,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969021808] [2022-11-18 19:47:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:13,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:47:15,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:15,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969021808] [2022-11-18 19:47:15,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969021808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:47:15,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82492188] [2022-11-18 19:47:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:15,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:15,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:47:15,910 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:47:15,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:47:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:16,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-18 19:47:16,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:47:16,327 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-11-18 19:47:16,492 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-11-18 19:47:16,506 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-11-18 19:47:16,522 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 19:47:16,522 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 18 treesize of output 28 [2022-11-18 19:47:16,529 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-11-18 19:47:16,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:16,602 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 33 treesize of output 28 [2022-11-18 19:47:16,620 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 19:47:16,621 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 26 treesize of output 36 [2022-11-18 19:47:16,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:16,639 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-11-18 19:47:16,773 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 19:47:16,776 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-11-18 19:47:16,783 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-11-18 19:47:16,799 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 19:47:16,800 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-11-18 19:47:17,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:17,237 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:47:17,238 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-11-18 19:47:17,259 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 19:47:17,260 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-11-18 19:47:17,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:17,269 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:47:17,270 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 49 treesize of output 51 [2022-11-18 19:47:17,300 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:47:17,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:17,353 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-11-18 19:47:17,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:17,366 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-11-18 19:47:17,586 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-11-18 19:47:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:47:17,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:47:18,188 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1144) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse0 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1144) .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))) is different from false [2022-11-18 19:47:22,693 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 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 ((.cse3 (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 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (= (select (select (store (let ((.cse62 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |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|)))))) (.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_1144 (Array Int Int))) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse61 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse4 (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 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse60 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |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|)))) (.cse38 (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 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= (select (select (store (let ((.cse59 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .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|)))) (.cse39 (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_1144 (Array Int Int))) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse57 (select (store (let ((.cse58 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse57 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse57 .cse9) |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|)))) (.cse5 (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_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (let ((.cse55 (select (store (let ((.cse56 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse55 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse55 .cse9) |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|)))) (.cse43 (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_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= (select (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse9) |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|))) (and (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |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|))) .cse2) (or (and .cse3 .cse4 .cse5) .cse2) .cse6 .cse4 (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 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (= (select (select (store (let ((.cse37 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |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|)))) (.cse10 (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_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (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_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse35 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse11 (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_1144 (Array Int Int))) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (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_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse33 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse12 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= (select (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .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|)))) (.cse13 (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_1144 (Array Int Int))) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse18 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |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|)))) (.cse26 (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_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= (select (select (store (let ((.cse29 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (and (or .cse2 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) .cse10 (or (and .cse11 .cse12 .cse13) .cse2) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) .cse11 (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_1144 (Array Int Int))) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse15 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse15 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (and .cse17 .cse10 .cse18) .cse2) (or (and .cse17 .cse10 (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse19 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse11 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (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 ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse21 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse12 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse23 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse13 (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse24 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse24 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse18 .cse26 (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (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_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse27 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse27 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse2) .cse13 .cse18 .cse26)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or (and .cse6 .cse38 .cse39) .cse2) .cse39 (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .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|))) .cse2) .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_1144 (Array Int Int))) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (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_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse41 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse41 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) .cse43 (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .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|) (= (select v_ArrVal_1144 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|))) .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_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse45 (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse45 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse45 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse3 .cse6 .cse4 (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_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse38 (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_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store (let ((.cse48 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse39 (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_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store (let ((.cse49 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse5 .cse43 (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_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse50 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse50 .cse9) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse52 (select (store (let ((.cse53 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse52 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse52 .cse9) |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)))) is different from false [2022-11-18 19:47:25,583 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse33 (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 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (= (select (select (store (let ((.cse61 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |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|)))))) (.cse35 (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 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse60 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |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|)))) (.cse34 (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_1144 (Array Int Int))) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse59 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse41 (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 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= (select (select (store (let ((.cse58 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .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|)))) (.cse43 (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_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= (select (select (store (let ((.cse57 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse44 (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_1144 (Array Int Int))) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse55 (select (store (let ((.cse56 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse55 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse55 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse48 (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_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse53 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse53 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) (and (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .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|))) .cse2) (or (let ((.cse7 (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_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= (select (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4))))))) (.cse5 (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_1144 (Array Int Int))) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse30 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse30 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse13 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= (select (select (store (let ((.cse29 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .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|)))) (.cse8 (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_1144 (Array Int Int))) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse9 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (= (select (select (store (let ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |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|)))) (.cse6 (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_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse25 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse25 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse18 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |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|))))) (and (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)))) .cse2) (or .cse2 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5 .cse6 .cse7 .cse8 (or .cse2 (and .cse9 (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse10 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse11 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse6 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse12 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)))) .cse7 .cse13 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (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 ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse14 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse8 (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse16 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)))) .cse18 (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse19 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse2 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1144 (Array Int Int))) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse22 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse22 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or (and .cse5 .cse13 .cse8) .cse2) (or (and .cse9 .cse6 .cse18) .cse2))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (or .cse2 (and .cse33 .cse34 .cse35 (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_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (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_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse36 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse36 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse38 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse38 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|))) (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_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse41 (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_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store (let ((.cse42 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse43 .cse44 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (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_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)))) (= |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_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse46 (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse46 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse46 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .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|))) .cse48)) .cse34 .cse35 (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 (forall ((v_ArrVal_1144 (Array Int Int))) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse49 (select (store (let ((.cse50 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse49 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse49 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (or (and .cse33 .cse35 .cse48) .cse2) (or .cse2 (and .cse34 .cse41 .cse44)) .cse43 .cse44 (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse51 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |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|))) .cse2) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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|) (= (select (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .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|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)))) .cse2) .cse48))) is different from false [2022-11-18 19:47:26,976 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse5 (forall ((v_subst_6 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_6) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse61 (store |c_#memory_int| v_subst_6 v_ArrVal_1133))) (store .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_6 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_6)))))) (.cse20 (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 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (= (select (select (store (let ((.cse60 (store |c_#memory_int| v_subst_3 v_ArrVal_1133))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_3 v_ArrVal_1144) |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_3)))))) (.cse18 (forall ((v_subst_5 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_5) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (let ((.cse58 (select (store (let ((.cse59 (store |c_#memory_int| v_subst_5 v_ArrVal_1133))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_5 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse58 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse58 4)))))))))) (.cse19 (forall ((v_subst_4 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_4) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse57 (store |c_#memory_int| v_subst_4 v_ArrVal_1133))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_4 v_ArrVal_1144) |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_4)))))) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse0 (forall ((v_subst_30 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_30) (forall ((v_ArrVal_1144 (Array Int Int))) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse55 (select (store (let ((.cse56 (store |c_#memory_int| v_subst_30 v_ArrVal_1133))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_30 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse55 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse55 .cse2))))) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_30)))) (.cse16 (forall ((v_subst_2 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1144 (Array Int Int))) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse54 (store |c_#memory_int| v_subst_2 v_ArrVal_1133))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_2 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select v_ArrVal_1144 .cse2) |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)))) (.cse17 (forall ((v_subst_28 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_28) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= (select (select (store (let ((.cse53 (store |c_#memory_int| v_subst_28 v_ArrVal_1133))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_28 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_28))))))) (and .cse0 (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_1 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_1) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int| v_subst_1 v_ArrVal_1133))) (store .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_1 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2)))) .cse3) (or (forall ((v_ArrVal_1140 Int) (v_subst_34 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store (let ((.cse4 (store |c_#memory_int| v_subst_34 v_ArrVal_1133))) (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_1140))) v_subst_34 v_ArrVal_1144) |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_34) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_34) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse3) .cse5 (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_33 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse6 (store |c_#memory_int| v_subst_33 v_ArrVal_1133))) (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_1140))) v_subst_33 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_33) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_33) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse3) (or (and (forall ((v_subst_26 Int)) (or (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| v_subst_26 v_ArrVal_1133))) (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_1140))) v_subst_26 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse7 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_26))) .cse0 (forall ((v_subst_29 Int)) (or (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse9 (store |c_#memory_int| v_subst_29 v_ArrVal_1133))) (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_1140))) v_subst_29 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_29))) (forall ((v_subst_24 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_24) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse10 (store |c_#memory_int| v_subst_24 v_ArrVal_1133))) (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_1140))) v_subst_24 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse5 (forall ((v_subst_25 Int)) (or (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| v_subst_25 v_ArrVal_1133))) (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_1140))) v_subst_25 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse11 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 4))))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_25))) (forall ((v_subst_27 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_27) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| v_subst_27 v_ArrVal_1133))) (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_1140))) v_subst_27 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse13 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_subst_31 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_31) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store (let ((.cse15 (store |c_#memory_int| v_subst_31 v_ArrVal_1133))) (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_1140))) v_subst_31 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse16 .cse17 .cse18 .cse19 .cse20) .cse3) .cse16 (or (let ((.cse32 (forall ((v_subst_14 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (= (select (select (store (let ((.cse50 (store |c_#memory_int| v_subst_14 v_ArrVal_1133))) (store .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_14 v_ArrVal_1144) |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_14)))) (.cse21 (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_1144 (Array Int Int))) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse49 (store |c_#memory_int| v_subst_16 v_ArrVal_1133))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_16 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2))) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse22 (forall ((v_subst_7 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse48 (store |c_#memory_int| v_subst_7 v_ArrVal_1133))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_7 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_7)))) (.cse24 (forall ((v_subst_19 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_19) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (or (= (select (select (store (let ((.cse47 (store |c_#memory_int| v_subst_19 v_ArrVal_1133))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_19 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse23 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_11 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_11) (forall ((v_ArrVal_1144 (Array Int Int))) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse45 (select (store (let ((.cse46 (store |c_#memory_int| v_subst_11 v_ArrVal_1133))) (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_1140))) v_subst_11 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse45 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse45 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse30 (forall ((v_subst_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse44 (store |c_#memory_int| v_subst_8 v_ArrVal_1133))) (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_1140))) v_subst_8 v_ArrVal_1144) |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_8)))) (.cse31 (forall ((v_subst_17 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| v_subst_17 v_ArrVal_1133))) (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_1140))) v_subst_17 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse42 4)) (= (select .cse42 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (and (or (and .cse21 .cse22 .cse23) .cse3) .cse21 .cse24 (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|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) (= (select (select (store (let ((.cse25 (store |c_#memory_int| v_subst_22 v_ArrVal_1133))) (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_1140))) v_subst_22 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse3) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_21 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_21) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse26 (store |c_#memory_int| v_subst_21 v_ArrVal_1133))) (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_1140))) v_subst_21 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2)))) .cse3) .cse23 (forall ((v_subst_23 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_23) (forall ((v_ArrVal_1144 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int| v_subst_23 v_ArrVal_1133))) (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_1140))) v_subst_23 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse27 4)) (= (select .cse27 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or .cse3 (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_20 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_20) (= (select (select (store (let ((.cse29 (store |c_#memory_int| v_subst_20 v_ArrVal_1133))) (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_1140))) v_subst_20 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse30 .cse31 (or .cse3 (and .cse32 .cse30 .cse31)) (or (and (forall ((v_ArrVal_1140 Int) (v_subst_12 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store (let ((.cse33 (store |c_#memory_int| v_subst_12 v_ArrVal_1133))) (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_1140))) v_subst_12 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_subst_18 Int) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| v_subst_18 v_ArrVal_1133))) (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_1140))) v_subst_18 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse34 .cse2)) (= (select .cse34 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_10 Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int| v_subst_10 v_ArrVal_1133))) (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_1140))) v_subst_10 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse36 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse36 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse32 .cse21 .cse22 .cse24 (forall ((v_ArrVal_1140 Int) (v_subst_9 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store (let ((.cse38 (store |c_#memory_int| v_subst_9 v_ArrVal_1133))) (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_1140))) v_subst_9 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_subst_15 Int) (v_ArrVal_1140 Int) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1133 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| v_subst_15 v_ArrVal_1133))) (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_1140))) v_subst_15 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse39 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse39 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_subst_13 Int) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (= (select (select (store (let ((.cse41 (store |c_#memory_int| v_subst_13 v_ArrVal_1133))) (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_1140))) v_subst_13 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse23 .cse30 .cse31) .cse3))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (or (and .cse18 .cse19 .cse20) .cse3) .cse18 .cse19 (or .cse3 (and .cse0 .cse16 .cse17)) (forall ((v_subst_32 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_32) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1144 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1144 4)) (= (select v_ArrVal_1144 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_1140 Int) (v_ArrVal_1133 (Array Int Int))) (let ((.cse51 (select (store (let ((.cse52 (store |c_#memory_int| v_subst_32 v_ArrVal_1133))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1140))) v_subst_32 v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse51 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse51 .cse2))))))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_32)))))))) is different from false [2022-11-18 19:47:27,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:27,562 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 37 [2022-11-18 19:47:27,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:27,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:27,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:27,576 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 41 treesize of output 43 [2022-11-18 19:47:27,621 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 41 treesize of output 29 [2022-11-18 19:47:27,637 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:27,638 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-11-18 19:47:27,646 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:27,647 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-11-18 19:47:27,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:27,656 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 37 [2022-11-18 19:47:27,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:27,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:27,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:27,672 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 41 treesize of output 43 [2022-11-18 19:47:27,704 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 41 treesize of output 29 [2022-11-18 19:47:27,729 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:27,731 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-11-18 19:47:27,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:27,752 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 46 treesize of output 37 [2022-11-18 19:47:27,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:27,768 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 19:47:27,769 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 1184 treesize of output 1137 [2022-11-18 19:47:27,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:27,786 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 1078 treesize of output 1014 [2022-11-18 19:47:27,800 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 1022 treesize of output 986 [2022-11-18 19:47:27,826 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 491 treesize of output 459 [2022-11-18 19:47:27,846 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 957 treesize of output 825 [2022-11-18 19:47:28,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:47:28,225 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-11-18 19:47:28,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:28,242 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 19:47:28,243 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 549 treesize of output 526 [2022-11-18 19:47:28,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:28,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:28,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:28,257 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 491 treesize of output 467 [2022-11-18 19:47:28,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:28,282 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 467 treesize of output 419 [2022-11-18 19:47:28,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:28,305 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 219 treesize of output 203 [2022-11-18 19:47:28,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:28,326 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 209 treesize of output 197 [2022-11-18 19:47:28,407 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,407 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-11-18 19:47:28,416 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,416 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-11-18 19:47:28,425 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,425 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-11-18 19:47:28,443 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,444 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-11-18 19:47:28,453 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,453 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-11-18 19:47:28,462 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,463 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-11-18 19:47:28,481 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,482 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-11-18 19:47:28,491 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,492 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-11-18 19:47:28,502 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,502 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-11-18 19:47:28,512 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,512 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-11-18 19:47:28,522 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,522 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-11-18 19:47:28,536 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,536 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-11-18 19:47:28,545 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,546 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-11-18 19:47:28,556 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,556 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-11-18 19:47:28,565 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,566 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-11-18 19:47:28,574 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,575 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-11-18 19:47:28,584 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,585 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-11-18 19:47:28,595 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,595 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-11-18 19:47:28,605 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,606 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-11-18 19:47:28,616 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,617 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-11-18 19:47:28,632 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,633 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-11-18 19:47:28,642 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,643 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-11-18 19:47:28,653 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:47:28,653 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-11-18 19:47:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 16 not checked. [2022-11-18 19:47:28,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82492188] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:47:28,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:47:28,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 18] total 50 [2022-11-18 19:47:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396327171] [2022-11-18 19:47:28,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:47:28,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-18 19:47:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:28,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-18 19:47:28,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1903, Unknown=26, NotChecked=364, Total=2450 [2022-11-18 19:47:28,874 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:37,674 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-11-18 19:47:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 19:47:37,675 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 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-11-18 19:47:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:37,675 INFO L225 Difference]: With dead ends: 89 [2022-11-18 19:47:37,675 INFO L226 Difference]: Without dead ends: 89 [2022-11-18 19:47:37,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=424, Invalid=3472, Unknown=26, NotChecked=500, Total=4422 [2022-11-18 19:47:37,676 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 88 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:37,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 525 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 586 Invalid, 0 Unknown, 351 Unchecked, 0.6s Time] [2022-11-18 19:47:37,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-18 19:47:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2022-11-18 19:47:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-18 19:47:37,680 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 39 [2022-11-18 19:47:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:37,680 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-18 19:47:37,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-18 19:47:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 19:47:37,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:37,682 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-11-18 19:47:37,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 19:47:37,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 19:47:37,888 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-18 19:47:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1852999400, now seen corresponding path program 1 times [2022-11-18 19:47:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:37,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924883761] [2022-11-18 19:47:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:47:38,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:38,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924883761] [2022-11-18 19:47:38,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924883761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:47:38,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694984359] [2022-11-18 19:47:38,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:38,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:38,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:47:38,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:47:38,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:47:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:38,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-18 19:47:38,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:47:38,803 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-11-18 19:47:38,865 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:47:38,865 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-11-18 19:47:38,902 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:47:38,902 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-11-18 19:47:38,961 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:47:38,961 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-11-18 19:47:39,065 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 19:47:39,065 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-11-18 19:47:39,113 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-11-18 19:47:39,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:39,158 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-11-18 19:47:39,224 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-11-18 19:47:39,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:39,393 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:47:39,394 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-11-18 19:47:39,421 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-11-18 19:47:39,421 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-11-18 19:47:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:47:39,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:47:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 19:47:39,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694984359] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:47:39,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:47:39,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 32 [2022-11-18 19:47:39,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644473687] [2022-11-18 19:47:39,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:47:39,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-18 19:47:39,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:39,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-18 19:47:39,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2022-11-18 19:47:39,928 INFO L87 Difference]: Start difference. First operand 73 states and 78 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-11-18 19:47:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:47:40,342 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2022-11-18 19:47:40,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:47:40,342 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-11-18 19:47:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:47:40,343 INFO L225 Difference]: With dead ends: 74 [2022-11-18 19:47:40,343 INFO L226 Difference]: Without dead ends: 74 [2022-11-18 19:47:40,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2022-11-18 19:47:40,344 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 51 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:47:40,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 417 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 300 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2022-11-18 19:47:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-18 19:47:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-11-18 19:47:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:47:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-11-18 19:47:40,348 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 40 [2022-11-18 19:47:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:47:40,348 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-11-18 19:47:40,348 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-11-18 19:47:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-11-18 19:47:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-18 19:47:40,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:47:40,350 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-11-18 19:47:40,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:47:40,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:40,556 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-18 19:47:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2022-11-18 19:47:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:40,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134597832] [2022-11-18 19:47:40,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:47:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:42,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134597832] [2022-11-18 19:47:42,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134597832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:47:42,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102216045] [2022-11-18 19:47:42,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:47:42,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:47:42,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:47:42,541 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:47:42,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 19:47:42,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:47:42,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:47:42,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-18 19:47:42,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:47:42,786 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-11-18 19:47:42,922 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:47:42,923 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-11-18 19:47:43,002 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-11-18 19:47:43,014 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-11-18 19:47:43,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:43,083 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-11-18 19:47:43,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:43,093 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-11-18 19:47:43,193 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 19:47:43,193 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-11-18 19:47:43,329 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 19:47:43,329 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-11-18 19:47:43,344 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-18 19:47:43,344 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-11-18 19:47:43,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:43,504 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:47:43,505 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-11-18 19:47:43,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:43,516 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 19:47:43,516 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-11-18 19:47:43,763 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-11-18 19:47:43,764 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-11-18 19:47:43,794 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 19:47:43,795 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-11-18 19:47:44,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:44,804 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-11-18 19:47:44,805 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-11-18 19:47:44,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:44,818 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2022-11-18 19:47:44,818 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-11-18 19:47:45,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:47:45,627 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-18 19:47:45,627 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-11-18 19:47:45,658 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-18 19:47:45,658 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 83 treesize of output 80 [2022-11-18 19:47:45,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:47:45,821 INFO L321 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2022-11-18 19:47:45,822 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 118 treesize of output 83 [2022-11-18 19:47:45,864 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-11-18 19:47:45,864 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 58 treesize of output 56 [2022-11-18 19:47:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:47:46,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:48:34,366 WARN L233 SmtUtils]: Spent 12.92s on a formula simplification. DAG size of input: 183 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:48:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:48:34,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102216045] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:48:34,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:48:34,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 51 [2022-11-18 19:48:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116769027] [2022-11-18 19:48:34,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:48:34,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-18 19:48:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:48:34,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-18 19:48:34,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2487, Unknown=1, NotChecked=0, Total=2652 [2022-11-18 19:48:34,895 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 52 states, 51 states have (on average 2.215686274509804) internal successors, (113), 52 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:48:38,032 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-11-18 19:48:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 19:48:38,033 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.215686274509804) internal successors, (113), 52 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-18 19:48:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:48:38,033 INFO L225 Difference]: With dead ends: 99 [2022-11-18 19:48:38,034 INFO L226 Difference]: Without dead ends: 99 [2022-11-18 19:48:38,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=388, Invalid=4303, Unknown=1, NotChecked=0, Total=4692 [2022-11-18 19:48:38,035 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 152 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:48:38,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 483 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 675 Invalid, 0 Unknown, 414 Unchecked, 0.7s Time] [2022-11-18 19:48:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-18 19:48:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-11-18 19:48:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-11-18 19:48:38,039 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 43 [2022-11-18 19:48:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:48:38,039 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-11-18 19:48:38,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.215686274509804) internal successors, (113), 52 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:48:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-11-18 19:48:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-18 19:48:38,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:48:38,041 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-11-18 19:48:38,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 19:48:38,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 19:48:38,248 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-18 19:48:38,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:48:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728483, now seen corresponding path program 2 times [2022-11-18 19:48:38,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:48:38,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144229366] [2022-11-18 19:48:38,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:48:38,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:48:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:48:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:48:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:48:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144229366] [2022-11-18 19:48:41,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144229366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:48:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318143422] [2022-11-18 19:48:41,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:48:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:48:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:48:41,163 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:48:41,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 19:48:41,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:48:41,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:48:41,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-18 19:48:41,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:48:41,416 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-11-18 19:48:41,625 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:48:41,625 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-11-18 19:48:41,649 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:48:41,649 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-11-18 19:48:41,742 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-11-18 19:48:41,752 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-11-18 19:48:41,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:48:41,827 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-11-18 19:48:41,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:48:41,840 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-11-18 19:48:41,945 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 19:48:41,945 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-11-18 19:48:42,098 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 19:48:42,098 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-11-18 19:48:42,138 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-18 19:48:42,138 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-11-18 19:48:42,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:48:42,330 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:48:42,331 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-11-18 19:48:42,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:48:42,342 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 19:48:42,343 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-11-18 19:48:42,690 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-11-18 19:48:42,690 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-11-18 19:48:42,726 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 19:48:42,726 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-11-18 19:48:44,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:48:44,181 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2022-11-18 19:48:44,181 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-11-18 19:48:44,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:48:44,204 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-11-18 19:48:44,205 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-11-18 19:48:45,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:48:45,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:48:45,429 INFO L321 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2022-11-18 19:48:45,429 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-11-18 19:48:45,505 INFO L321 Elim1Store]: treesize reduction 62, result has 34.7 percent of original size [2022-11-18 19:48:45,505 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 7 case distinctions, treesize of input 100 treesize of output 94 [2022-11-18 19:48:45,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:48:45,821 INFO L321 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2022-11-18 19:48:45,822 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-11-18 19:48:45,892 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-11-18 19:48:45,893 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-11-18 19:48:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:48:46,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:49:01,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:49:01,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:49:12,450 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 343 treesize of output 333 [2022-11-18 19:49:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:49:12,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318143422] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:49:12,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:49:12,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 60 [2022-11-18 19:49:12,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089793471] [2022-11-18 19:49:12,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:49:12,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-18 19:49:12,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:12,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-18 19:49:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3440, Unknown=2, NotChecked=0, Total=3660 [2022-11-18 19:49:12,893 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 61 states, 60 states have (on average 1.95) internal successors, (117), 61 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-11-18 19:49:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:19,939 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-11-18 19:49:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 19:49:19,940 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.95) internal successors, (117), 61 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-11-18 19:49:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:19,940 INFO L225 Difference]: With dead ends: 78 [2022-11-18 19:49:19,941 INFO L226 Difference]: Without dead ends: 78 [2022-11-18 19:49:19,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=583, Invalid=6387, Unknown=2, NotChecked=0, Total=6972 [2022-11-18 19:49:19,942 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 113 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 436 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:19,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 428 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 499 Invalid, 0 Unknown, 436 Unchecked, 0.6s Time] [2022-11-18 19:49:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-18 19:49:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-11-18 19:49:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-18 19:49:19,945 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 43 [2022-11-18 19:49:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:19,945 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-18 19:49:19,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.95) internal successors, (117), 61 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-11-18 19:49:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-18 19:49:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-18 19:49:19,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:19,947 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-11-18 19:49:19,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 19:49:20,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 19:49:20,153 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-18 19:49:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 97977167, now seen corresponding path program 2 times [2022-11-18 19:49:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:20,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354163062] [2022-11-18 19:49:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:49:23,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:23,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354163062] [2022-11-18 19:49:23,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354163062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:49:23,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585107742] [2022-11-18 19:49:23,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:49:23,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:49:23,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:49:23,973 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:49:23,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cf3e02-aa6b-4ddf-98b1-39b9db962476/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 19:49:24,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:49:24,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:49:24,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-18 19:49:24,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:49:24,215 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-11-18 19:49:24,272 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:49:24,272 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-11-18 19:49:24,342 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:49:24,343 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-11-18 19:49:24,463 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-11-18 19:49:24,683 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 19:49:24,683 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-11-18 19:49:24,742 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-11-18 19:49:24,750 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 20 treesize of output 22 [2022-11-18 19:49:24,759 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-11-18 19:49:24,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:49:24,785 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-11-18 19:49:24,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:49:24,793 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 43 treesize of output 34 [2022-11-18 19:49:24,803 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 20 treesize of output 22 [2022-11-18 19:49:25,020 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 19:49:25,021 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 41 treesize of output 36 [2022-11-18 19:49:25,041 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:49:25,042 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 16 treesize of output 22 [2022-11-18 19:49:25,050 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-11-18 19:49:25,105 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-18 19:49:25,106 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-11-18 19:49:25,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:49:25,304 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:49:25,305 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 133 treesize of output 90 [2022-11-18 19:49:25,348 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-18 19:49:25,348 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 107 treesize of output 144 [2022-11-18 19:49:25,406 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:49:25,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:49:25,548 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 19:49:25,548 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-11-18 19:49:25,995 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-18 19:49:25,995 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 2 case distinctions, treesize of input 177 treesize of output 146 [2022-11-18 19:49:26,032 INFO L321 Elim1Store]: treesize reduction 80, result has 25.2 percent of original size [2022-11-18 19:49:26,033 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 131 treesize of output 140 [2022-11-18 19:49:26,064 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-18 19:49:26,064 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 161 treesize of output 110 [2022-11-18 19:49:27,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:49:27,509 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-18 19:49:27,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 309 treesize of output 238 [2022-11-18 19:49:27,619 INFO L321 Elim1Store]: treesize reduction 78, result has 65.5 percent of original size [2022-11-18 19:49:27,620 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 350 treesize of output 466 [2022-11-18 19:49:27,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:49:27,724 INFO L321 Elim1Store]: treesize reduction 280, result has 11.4 percent of original size [2022-11-18 19:49:27,725 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 8 new quantified variables, introduced 20 case distinctions, treesize of input 472 treesize of output 332 [2022-11-18 19:49:28,072 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:49:32,386 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:49:32,650 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:49:32,775 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 19:49:33,504 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 11 treesize of output 3 [2022-11-18 19:49:33,540 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 11 treesize of output 3 [2022-11-18 19:49:33,731 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 11 treesize of output 3 [2022-11-18 19:49:33,788 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 11 treesize of output 3 [2022-11-18 19:49:34,147 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 11 treesize of output 3 [2022-11-18 19:49:34,203 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 11 treesize of output 3 [2022-11-18 19:49:34,361 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 11 treesize of output 3 [2022-11-18 19:49:34,579 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 11 treesize of output 3 [2022-11-18 19:49:40,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:49:40,551 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-11-18 19:49:40,552 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 175 treesize of output 130 [2022-11-18 19:49:40,605 INFO L321 Elim1Store]: treesize reduction 124, result has 15.1 percent of original size [2022-11-18 19:49:40,605 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 150 treesize of output 117 [2022-11-18 19:49:40,629 INFO L321 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-18 19:49:40,629 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 118 treesize of output 120 [2022-11-18 19:49:40,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:49:40,906 INFO L321 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2022-11-18 19:49:40,907 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 193 treesize of output 142 [2022-11-18 19:49:40,985 INFO L321 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2022-11-18 19:49:40,986 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 102 [2022-11-18 19:49:41,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-11-18 19:49:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:49:41,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:50:48,284 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1937 Int) (v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1943 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1933 Int)) (let ((.cse2 (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_1937)))) (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|)))) (.cse5 (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_1933)))) (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 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse3 (select .cse2 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse3 0)) (.cse4 (select .cse6 0))) (let ((.cse0 (select (select (store .cse5 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 4 v_ArrVal_1946)) .cse1) .cse4))) (or (= .cse0 0) (= (select (select (store (store (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1934) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1939) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1944) .cse1 v_ArrVal_1948) (select (select (store .cse2 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 4 v_ArrVal_1943)) .cse1) .cse4)) (+ .cse0 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1937 Int) (v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1943 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1933 Int)) (let ((.cse14 (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_1937)))) (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|)))) (.cse11 (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_1933)))) (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 ((.cse12 (select .cse11 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse15 (select .cse14 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse10 (select .cse15 0)) (.cse13 (select .cse12 0))) (let ((.cse9 (select (select (store .cse14 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse15 4 v_ArrVal_1943)) .cse10) .cse13))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse9) (= (select (select (store (store (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1934) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1939) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1944) .cse10 v_ArrVal_1948) .cse9) (+ (select (select (store .cse11 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse12 4 v_ArrVal_1946)) .cse10) .cse13) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) is different from false [2022-11-18 19:50:49,925 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1946 Int) (v_subst_36 Int) (v_ArrVal_1937 Int) (v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1933 Int)) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.base| v_subst_36 (store (store (select |c_#memory_$Pointer$.base| v_subst_36) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1937)))) (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_36)))) (.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.offset| v_subst_36 (store (store (select |c_#memory_$Pointer$.offset| v_subst_36) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1933)))) (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_36)) (.cse6 (select .cse5 v_subst_36))) (let ((.cse0 (select .cse6 0)) (.cse4 (select .cse3 0))) (let ((.cse1 (select (select (store .cse5 v_subst_36 (store .cse6 4 v_ArrVal_1943)) .cse0) .cse4))) (or (= (select (select (store (store (store (store |c_#memory_int| v_subst_36 v_ArrVal_1934) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1939) v_subst_36 v_ArrVal_1944) .cse0 v_ArrVal_1948) .cse1) (+ (select (select (store .cse2 v_subst_36 (store .cse3 4 v_ArrVal_1946)) .cse0) .cse4) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse1 v_subst_36))))))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1946 Int) (v_subst_35 Int) (v_ArrVal_1937 Int) (v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1933 Int)) (let ((.cse10 (let ((.cse17 (store |c_#memory_$Pointer$.base| v_subst_35 (store (store (select |c_#memory_$Pointer$.base| v_subst_35) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1937)))) (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_35)))) (.cse14 (let ((.cse16 (store |c_#memory_$Pointer$.offset| v_subst_35 (store (store (select |c_#memory_$Pointer$.offset| v_subst_35) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1933)))) (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_35)) (.cse11 (select .cse10 v_subst_35))) (let ((.cse9 (select .cse11 0)) (.cse12 (select .cse15 0))) (let ((.cse13 (select (select (store .cse14 v_subst_35 (store .cse15 4 v_ArrVal_1946)) .cse9) .cse12))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store (store |c_#memory_int| v_subst_35 v_ArrVal_1934) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1939) v_subst_35 v_ArrVal_1944) .cse9 v_ArrVal_1948) (select (select (store .cse10 v_subst_35 (store .cse11 4 v_ArrVal_1943)) .cse9) .cse12)) (+ .cse13 4))) (= .cse13 0)))))))) is different from false [2022-11-18 19:50:54,117 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_1925 Int) (v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1927 Int) (v_subst_35 Int) (v_ArrVal_1937 Int) (v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1943 Int) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1933 Int)) (let ((.cse1 (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_1925)))) (store .cse12 v_subst_35 (store (store (select .cse12 v_subst_35) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1937))))) (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_35)))) (.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_1927)))) (store .cse8 v_subst_35 (store (store (select .cse8 v_subst_35) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1933))))) (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_35)) (.cse2 (select .cse1 v_subst_35))) (let ((.cse0 (select .cse2 0)) (.cse3 (select .cse6 0))) (let ((.cse4 (select (select (store .cse5 v_subst_35 (store .cse6 4 v_ArrVal_1946)) .cse0) .cse3))) (or (= (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1926) v_subst_35 v_ArrVal_1934) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1939) v_subst_35 v_ArrVal_1944) .cse0 v_ArrVal_1948) (select (select (store .cse1 v_subst_35 (store .cse2 4 v_ArrVal_1943)) .cse0) .cse3)) (+ .cse4 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse4 0))))))) (forall ((v_ArrVal_1925 Int) (v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1946 Int) (v_subst_36 Int) (v_ArrVal_1927 Int) (v_ArrVal_1937 Int) (v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1943 Int) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1933 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_1925)))) (store .cse24 v_subst_36 (store (store (select .cse24 v_subst_36) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1937))))) (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_36)))) (.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_1927)))) (store .cse22 v_subst_36 (store (store (select .cse22 v_subst_36) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1933))))) (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_36)) (.cse20 (select .cse19 v_subst_36))) (let ((.cse15 (select .cse20 0)) (.cse18 (select .cse17 0))) (let ((.cse14 (select (select (store .cse19 v_subst_36 (store .cse20 4 v_ArrVal_1943)) .cse15) .cse18))) (or (= .cse14 v_subst_36) (= (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1926) v_subst_36 v_ArrVal_1934) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1939) v_subst_36 v_ArrVal_1944) .cse15 v_ArrVal_1948) .cse14) (+ (select (select (store .cse16 v_subst_36 (store .cse17 4 v_ArrVal_1946)) .cse15) .cse18) 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) is different from false [2022-11-18 19:50:54,973 INFO L321 Elim1Store]: treesize reduction 2665, result has 3.1 percent of original size [2022-11-18 19:50:54,976 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 15574611 treesize of output 15528534 [2022-11-18 19:51:01,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:51:01,831 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 19299150 treesize of output 17413852 [2022-11-18 19:51:09,708 INFO L321 Elim1Store]: treesize reduction 329, result has 31.6 percent of original size [2022-11-18 19:51:09,714 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 395176689 treesize of output 393079444