./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8 --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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- 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-e04fb08 [2022-11-16 12:43:33,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:43:33,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:43:33,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:43:33,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:43:33,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:43:33,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:43:33,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:43:33,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:43:33,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:43:33,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:43:33,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:43:33,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:43:33,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:43:33,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:43:33,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:43:33,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:43:33,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:43:33,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:43:33,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:43:33,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:43:33,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:43:33,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:43:33,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:43:33,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:43:33,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:43:33,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:43:33,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:43:33,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:43:33,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:43:33,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:43:33,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:43:33,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:43:33,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:43:33,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:43:33,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:43:33,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:43:33,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:43:33,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:43:33,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:43:33,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:43:33,341 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:43:33,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:43:33,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:43:33,383 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:43:33,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:43:33,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:43:33,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:43:33,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:43:33,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:43:33,386 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:43:33,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:43:33,387 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:43:33,388 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:43:33,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:43:33,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:43:33,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:43:33,389 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:43:33,389 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:43:33,389 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:43:33,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:43:33,389 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:43:33,390 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:43:33,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:43:33,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:43:33,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:43:33,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:43:33,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:43:33,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:43:33,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:43:33,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:43:33,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:43:33,394 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_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/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_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2022-11-16 12:43:33,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:43:33,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:43:33,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:43:33,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:43:33,702 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:43:33,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-11-16 12:43:33,778 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/data/391a6f9ca/22e3ba7918e94a048c3d1526a07aed0d/FLAGb3408a3dc [2022-11-16 12:43:34,284 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:43:34,284 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-11-16 12:43:34,296 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/data/391a6f9ca/22e3ba7918e94a048c3d1526a07aed0d/FLAGb3408a3dc [2022-11-16 12:43:34,573 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/data/391a6f9ca/22e3ba7918e94a048c3d1526a07aed0d [2022-11-16 12:43:34,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:43:34,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:43:34,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:43:34,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:43:34,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:43:34,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:34" (1/1) ... [2022-11-16 12:43:34,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa19b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:34, skipping insertion in model container [2022-11-16 12:43:34,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:34" (1/1) ... [2022-11-16 12:43:34,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:43:34,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:43:35,022 WARN L229 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_96653f72-3c35-4834-8d8a-cc00af8e45db/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-11-16 12:43:35,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:43:35,045 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:43:35,101 WARN L229 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_96653f72-3c35-4834-8d8a-cc00af8e45db/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-11-16 12:43:35,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:43:35,132 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:43:35,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35 WrapperNode [2022-11-16 12:43:35,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:43:35,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:43:35,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:43:35,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:43:35,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,221 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 164 [2022-11-16 12:43:35,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:43:35,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:43:35,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:43:35,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:43:35,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,288 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:43:35,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:43:35,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:43:35,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:43:35,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (1/1) ... [2022-11-16 12:43:35,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:43:35,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:35,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:43:35,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:43:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:43:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:43:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 12:43:35,393 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 12:43:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:43:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:43:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:43:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:43:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:43:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:43:35,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:43:35,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:43:35,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:43:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:43:35,535 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:43:35,537 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:43:36,093 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:43:36,100 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:43:36,100 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-16 12:43:36,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:36 BoogieIcfgContainer [2022-11-16 12:43:36,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:43:36,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:43:36,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:43:36,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:43:36,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:43:34" (1/3) ... [2022-11-16 12:43:36,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cb07f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:43:36, skipping insertion in model container [2022-11-16 12:43:36,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:35" (2/3) ... [2022-11-16 12:43:36,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cb07f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:43:36, skipping insertion in model container [2022-11-16 12:43:36,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:36" (3/3) ... [2022-11-16 12:43:36,121 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2022-11-16 12:43:36,140 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:43:36,141 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2022-11-16 12:43:36,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:43:36,224 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;@5160c5e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:43:36,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-11-16 12:43:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 127 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:43:36,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:43:36,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:36,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:43:36,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:36,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:36,242 INFO L85 PathProgramCache]: Analyzing trace with hash 895983381, now seen corresponding path program 1 times [2022-11-16 12:43:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:36,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853682247] [2022-11-16 12:43:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:36,545 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-16 12:43:36,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:36,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853682247] [2022-11-16 12:43:36,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853682247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:36,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:36,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:43:36,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244033955] [2022-11-16 12:43:36,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:36,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:43:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:36,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:43:36,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:43:36,612 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 127 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:36,846 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-11-16 12:43:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:43:36,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:43:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:36,861 INFO L225 Difference]: With dead ends: 130 [2022-11-16 12:43:36,861 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 12:43:36,863 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-16 12:43:36,869 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:36,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:43:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 12:43:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-16 12:43:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 67 states have (on average 1.955223880597015) internal successors, (131), 122 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:43:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-11-16 12:43:36,917 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 6 [2022-11-16 12:43:36,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:36,917 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-11-16 12:43:36,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-11-16 12:43:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:43:36,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:36,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:43:36,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:43:36,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash 895983382, now seen corresponding path program 1 times [2022-11-16 12:43:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:36,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069984878] [2022-11-16 12:43:36,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:37,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:37,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069984878] [2022-11-16 12:43:37,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069984878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:37,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:37,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:43:37,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141295160] [2022-11-16 12:43:37,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:37,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:43:37,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:37,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:43:37,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:43:37,041 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:37,170 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-11-16 12:43:37,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:43:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:43:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:37,174 INFO L225 Difference]: With dead ends: 125 [2022-11-16 12:43:37,174 INFO L226 Difference]: Without dead ends: 125 [2022-11-16 12:43:37,174 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-16 12:43:37,175 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:37,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 209 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:43:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-16 12:43:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-16 12:43:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 120 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:43:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-11-16 12:43:37,201 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 6 [2022-11-16 12:43:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:37,201 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-11-16 12:43:37,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-11-16 12:43:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:43:37,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:37,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:37,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:43:37,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash 229520599, now seen corresponding path program 1 times [2022-11-16 12:43:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:37,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747438195] [2022-11-16 12:43:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:37,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:37,372 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-16 12:43:37,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:37,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747438195] [2022-11-16 12:43:37,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747438195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:37,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:37,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:43:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541520868] [2022-11-16 12:43:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:37,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:43:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:37,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:43:37,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:43:37,375 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:43:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:37,543 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-11-16 12:43:37,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:43:37,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-16 12:43:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:37,551 INFO L225 Difference]: With dead ends: 132 [2022-11-16 12:43:37,551 INFO L226 Difference]: Without dead ends: 132 [2022-11-16 12:43:37,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:43:37,557 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:37,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 311 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:43:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-16 12:43:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2022-11-16 12:43:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 68 states have (on average 1.911764705882353) internal successors, (130), 121 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:43:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-11-16 12:43:37,593 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 13 [2022-11-16 12:43:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:37,594 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-11-16 12:43:37,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:43:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-11-16 12:43:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:43:37,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:37,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:37,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:43:37,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2102414876, now seen corresponding path program 1 times [2022-11-16 12:43:37,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:37,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586918721] [2022-11-16 12:43:37,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:37,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:43:37,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:37,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586918721] [2022-11-16 12:43:37,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586918721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:37,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:37,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:43:37,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956591983] [2022-11-16 12:43:37,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:37,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:43:37,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:37,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:43:37,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:43:37,956 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:43:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:38,326 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-11-16 12:43:38,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:43:38,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-16 12:43:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:38,329 INFO L225 Difference]: With dead ends: 126 [2022-11-16 12:43:38,329 INFO L226 Difference]: Without dead ends: 126 [2022-11-16 12:43:38,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:43:38,331 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 13 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:38,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 444 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:43:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-16 12:43:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-11-16 12:43:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 120 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:43:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-11-16 12:43:38,338 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 22 [2022-11-16 12:43:38,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:38,338 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-11-16 12:43:38,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:43:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-11-16 12:43:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:43:38,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:38,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:38,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:43:38,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:38,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2102414877, now seen corresponding path program 1 times [2022-11-16 12:43:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:38,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551398114] [2022-11-16 12:43:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:38,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:43:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:38,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551398114] [2022-11-16 12:43:38,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551398114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:38,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:38,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:43:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667621982] [2022-11-16 12:43:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:38,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:43:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:38,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:43:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:43:38,654 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:43:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:38,994 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-11-16 12:43:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:43:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-16 12:43:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:38,998 INFO L225 Difference]: With dead ends: 125 [2022-11-16 12:43:38,999 INFO L226 Difference]: Without dead ends: 125 [2022-11-16 12:43:38,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:43:39,000 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 11 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:39,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 468 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:43:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-16 12:43:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2022-11-16 12:43:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 119 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:43:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2022-11-16 12:43:39,017 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 22 [2022-11-16 12:43:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:39,018 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2022-11-16 12:43:39,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:43:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-11-16 12:43:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:43:39,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:39,020 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:39,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:43:39,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:39,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash -466517819, now seen corresponding path program 1 times [2022-11-16 12:43:39,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:39,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192510011] [2022-11-16 12:43:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:39,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:39,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:39,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:43:39,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:39,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192510011] [2022-11-16 12:43:39,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192510011] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:39,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777878240] [2022-11-16 12:43:39,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:39,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:39,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:39,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:43:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:39,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:43:39,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:39,703 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-16 12:43:39,789 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2022-11-16 12:43:39,824 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2022-11-16 12:43:39,854 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:43:39,854 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-16 12:43:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-16 12:43:39,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:43:40,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777878240] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:43:40,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:43:40,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-11-16 12:43:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058496208] [2022-11-16 12:43:40,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:40,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:43:40,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:40,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:43:40,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2022-11-16 12:43:40,353 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:43:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:40,734 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-11-16 12:43:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:43:40,734 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-16 12:43:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:40,736 INFO L225 Difference]: With dead ends: 130 [2022-11-16 12:43:40,736 INFO L226 Difference]: Without dead ends: 130 [2022-11-16 12:43:40,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=304, Unknown=2, NotChecked=74, Total=462 [2022-11-16 12:43:40,741 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 33 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:40,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 841 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 487 Invalid, 0 Unknown, 401 Unchecked, 0.3s Time] [2022-11-16 12:43:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-16 12:43:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-16 12:43:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 124 states have internal predecessors, (133), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:43:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-11-16 12:43:40,758 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 25 [2022-11-16 12:43:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:40,758 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-11-16 12:43:40,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:43:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-11-16 12:43:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:43:40,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:40,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:40,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:43:40,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 12:43:40,966 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:40,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:40,967 INFO L85 PathProgramCache]: Analyzing trace with hash -466517818, now seen corresponding path program 1 times [2022-11-16 12:43:40,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:40,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626344417] [2022-11-16 12:43:40,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:40,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:41,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:41,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:43:41,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:41,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626344417] [2022-11-16 12:43:41,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626344417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:41,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926361618] [2022-11-16 12:43:41,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:41,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:41,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:41,410 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:41,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:43:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:41,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 12:43:41,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:41,567 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-16 12:43:41,883 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:43:41,883 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-16 12:43:41,891 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:43:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:41,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:42,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926361618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:42,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:43:42,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-11-16 12:43:42,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588827751] [2022-11-16 12:43:42,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:42,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:43:42,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:42,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:43:42,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:43:42,169 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 12:43:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:42,998 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-11-16 12:43:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:43:43,000 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-11-16 12:43:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:43,001 INFO L225 Difference]: With dead ends: 131 [2022-11-16 12:43:43,001 INFO L226 Difference]: Without dead ends: 131 [2022-11-16 12:43:43,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:43:43,002 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 22 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:43,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 941 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 711 Invalid, 0 Unknown, 121 Unchecked, 0.6s Time] [2022-11-16 12:43:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-16 12:43:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-11-16 12:43:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 123 states have internal predecessors, (132), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:43:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-11-16 12:43:43,008 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 25 [2022-11-16 12:43:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:43,008 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-11-16 12:43:43,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 12:43:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-11-16 12:43:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:43:43,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:43,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:43,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:43:43,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:43,210 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash -342690401, now seen corresponding path program 1 times [2022-11-16 12:43:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:43,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220411237] [2022-11-16 12:43:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:43,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:43,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:43,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:43:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:43:43,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:43,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220411237] [2022-11-16 12:43:43,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220411237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:43,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066997995] [2022-11-16 12:43:43,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:43,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:43,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:43,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:43,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:43:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:43,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 12:43:43,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:43,953 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-16 12:43:43,967 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-16 12:43:43,990 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:43:44,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:44,050 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:43:44,093 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-16 12:43:44,109 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_522))))) is different from true [2022-11-16 12:43:44,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:44,185 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:43:44,211 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-16 12:43:44,244 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:43:44,244 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-16 12:43:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2022-11-16 12:43:44,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:44,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066997995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:44,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:43:44,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-11-16 12:43:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606451873] [2022-11-16 12:43:44,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:44,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:43:44,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:44,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:43:44,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=122, Unknown=3, NotChecked=72, Total=240 [2022-11-16 12:43:44,460 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-16 12:43:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:44,987 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2022-11-16 12:43:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:43:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-11-16 12:43:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:44,988 INFO L225 Difference]: With dead ends: 153 [2022-11-16 12:43:44,988 INFO L226 Difference]: Without dead ends: 153 [2022-11-16 12:43:44,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=189, Unknown=3, NotChecked=90, Total=342 [2022-11-16 12:43:44,990 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 158 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:44,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 489 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 492 Invalid, 0 Unknown, 375 Unchecked, 0.4s Time] [2022-11-16 12:43:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-16 12:43:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2022-11-16 12:43:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 125 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:43:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2022-11-16 12:43:44,997 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 37 [2022-11-16 12:43:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:44,997 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2022-11-16 12:43:44,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-16 12:43:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2022-11-16 12:43:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:43:44,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:44,999 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:45,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:43:45,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 12:43:45,207 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash -342690400, now seen corresponding path program 1 times [2022-11-16 12:43:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:45,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444016029] [2022-11-16 12:43:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:45,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:43:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-16 12:43:45,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:45,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444016029] [2022-11-16 12:43:45,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444016029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:45,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:45,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:43:45,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301571153] [2022-11-16 12:43:45,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:45,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:43:45,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:45,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:43:45,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:43:45,868 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:43:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:46,249 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-11-16 12:43:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:43:46,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-11-16 12:43:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:46,251 INFO L225 Difference]: With dead ends: 142 [2022-11-16 12:43:46,251 INFO L226 Difference]: Without dead ends: 142 [2022-11-16 12:43:46,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:43:46,252 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 391 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:46,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 220 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:43:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-16 12:43:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2022-11-16 12:43:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 116 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:43:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-11-16 12:43:46,262 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 37 [2022-11-16 12:43:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:46,262 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-11-16 12:43:46,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:43:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-11-16 12:43:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 12:43:46,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:46,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:46,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:43:46,264 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006624, now seen corresponding path program 1 times [2022-11-16 12:43:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:46,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666080438] [2022-11-16 12:43:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:46,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:46,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:43:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:43:46,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:46,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666080438] [2022-11-16 12:43:46,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666080438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:46,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:46,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:43:46,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591524640] [2022-11-16 12:43:46,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:46,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:43:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:46,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:43:46,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:43:46,413 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:43:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:46,625 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2022-11-16 12:43:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:43:46,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-16 12:43:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:46,626 INFO L225 Difference]: With dead ends: 140 [2022-11-16 12:43:46,626 INFO L226 Difference]: Without dead ends: 140 [2022-11-16 12:43:46,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:43:46,627 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 86 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:46,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 308 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:43:46,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-16 12:43:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2022-11-16 12:43:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 114 states have internal predecessors, (124), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:43:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2022-11-16 12:43:46,632 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 39 [2022-11-16 12:43:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:46,632 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2022-11-16 12:43:46,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:43:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2022-11-16 12:43:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 12:43:46,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:46,633 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:46,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:43:46,634 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:46,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:46,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006625, now seen corresponding path program 1 times [2022-11-16 12:43:46,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:46,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421050304] [2022-11-16 12:43:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:46,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:46,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:46,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:43:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:43:46,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:46,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421050304] [2022-11-16 12:43:46,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421050304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:46,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:46,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:43:46,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106733251] [2022-11-16 12:43:46,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:46,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:43:46,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:46,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:43:46,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:43:46,946 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:43:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:47,148 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2022-11-16 12:43:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:43:47,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-16 12:43:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:47,150 INFO L225 Difference]: With dead ends: 120 [2022-11-16 12:43:47,150 INFO L226 Difference]: Without dead ends: 120 [2022-11-16 12:43:47,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:43:47,152 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 87 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:47,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 327 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:43:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-16 12:43:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-16 12:43:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:43:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2022-11-16 12:43:47,156 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 39 [2022-11-16 12:43:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:47,156 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2022-11-16 12:43:47,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:43:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2022-11-16 12:43:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:43:47,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:47,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:47,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:43:47,160 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1473750501, now seen corresponding path program 1 times [2022-11-16 12:43:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:47,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963627745] [2022-11-16 12:43:47,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:47,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:47,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:47,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:47,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:43:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:43:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:47,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963627745] [2022-11-16 12:43:47,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963627745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:47,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399576378] [2022-11-16 12:43:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:47,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:47,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:47,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:48,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:43:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:48,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 12:43:48,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:48,424 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 9 treesize of output 5 [2022-11-16 12:43:48,560 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_978 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_978))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-16 12:43:48,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:48,600 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 16 treesize of output 18 [2022-11-16 12:43:48,614 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 12:43:48,615 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 16 treesize of output 18 [2022-11-16 12:43:48,718 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 17 treesize of output 9 [2022-11-16 12:43:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 12:43:48,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:43:48,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399576378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:48,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:43:48,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-16 12:43:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963110600] [2022-11-16 12:43:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:48,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:43:48,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:48,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:43:48,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-11-16 12:43:48,741 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:43:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:49,290 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2022-11-16 12:43:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:43:49,291 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-16 12:43:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:49,292 INFO L225 Difference]: With dead ends: 176 [2022-11-16 12:43:49,292 INFO L226 Difference]: Without dead ends: 176 [2022-11-16 12:43:49,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=703, Unknown=2, NotChecked=54, Total=870 [2022-11-16 12:43:49,294 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 83 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:49,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1009 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 688 Invalid, 0 Unknown, 291 Unchecked, 0.4s Time] [2022-11-16 12:43:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-16 12:43:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 119. [2022-11-16 12:43:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 111 states have internal predecessors, (122), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:43:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-11-16 12:43:49,299 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 41 [2022-11-16 12:43:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:49,299 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-11-16 12:43:49,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:43:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-11-16 12:43:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:43:49,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:49,301 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:49,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:43:49,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:43:49,507 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:49,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1473750502, now seen corresponding path program 1 times [2022-11-16 12:43:49,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:49,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151038201] [2022-11-16 12:43:49,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:49,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:50,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:50,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:43:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:43:50,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:50,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151038201] [2022-11-16 12:43:50,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151038201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:50,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013937442] [2022-11-16 12:43:50,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:50,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:50,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:50,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:50,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:43:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:51,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 12:43:51,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:51,136 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-16 12:43:51,633 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 19 treesize of output 11 [2022-11-16 12:43:51,640 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-16 12:43:51,815 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1137) |c_#memory_$Pointer$.offset|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1138)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 12:43:51,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:51,880 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 21 [2022-11-16 12:43:51,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:51,897 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 25 treesize of output 25 [2022-11-16 12:43:51,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:51,904 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 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-16 12:43:51,912 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:43:51,912 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 15 treesize of output 15 [2022-11-16 12:43:51,999 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 17 treesize of output 9 [2022-11-16 12:43:52,005 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 22 treesize of output 10 [2022-11-16 12:43:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 12:43:52,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:53,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013937442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:53,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:43:53,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-11-16 12:43:53,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388540485] [2022-11-16 12:43:53,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:53,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 12:43:53,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:53,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 12:43:53,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2022-11-16 12:43:53,201 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:43:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:55,860 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-11-16 12:43:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:43:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-16 12:43:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:55,862 INFO L225 Difference]: With dead ends: 185 [2022-11-16 12:43:55,862 INFO L226 Difference]: Without dead ends: 185 [2022-11-16 12:43:55,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2022-11-16 12:43:55,864 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 416 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:55,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1621 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1913 Invalid, 0 Unknown, 178 Unchecked, 1.6s Time] [2022-11-16 12:43:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-16 12:43:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 123. [2022-11-16 12:43:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 115 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:43:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2022-11-16 12:43:55,870 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 41 [2022-11-16 12:43:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:55,870 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2022-11-16 12:43:55,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:43:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2022-11-16 12:43:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:43:55,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:55,872 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:55,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:43:56,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:56,087 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1566007957, now seen corresponding path program 1 times [2022-11-16 12:43:56,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:56,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52572350] [2022-11-16 12:43:56,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:56,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:56,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:56,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:43:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-16 12:43:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:56,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52572350] [2022-11-16 12:43:56,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52572350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:56,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:56,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:43:56,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200418806] [2022-11-16 12:43:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:56,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:43:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:56,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:43:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:43:56,238 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:43:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:56,367 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-11-16 12:43:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:43:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-11-16 12:43:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:56,369 INFO L225 Difference]: With dead ends: 140 [2022-11-16 12:43:56,369 INFO L226 Difference]: Without dead ends: 140 [2022-11-16 12:43:56,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:43:56,370 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 252 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:56,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 167 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:43:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-16 12:43:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2022-11-16 12:43:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 114 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:43:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2022-11-16 12:43:56,376 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 42 [2022-11-16 12:43:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:56,377 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2022-11-16 12:43:56,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:43:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2022-11-16 12:43:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:43:56,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:56,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:56,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:43:56,379 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:56,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1190116815, now seen corresponding path program 1 times [2022-11-16 12:43:56,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:56,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125699319] [2022-11-16 12:43:56,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:56,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:56,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:56,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:43:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:43:56,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:56,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125699319] [2022-11-16 12:43:56,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125699319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:56,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:56,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:43:56,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417256146] [2022-11-16 12:43:56,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:56,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:43:56,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:56,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:43:56,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:43:56,724 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:43:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:57,116 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2022-11-16 12:43:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:43:57,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-11-16 12:43:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:57,117 INFO L225 Difference]: With dead ends: 195 [2022-11-16 12:43:57,117 INFO L226 Difference]: Without dead ends: 195 [2022-11-16 12:43:57,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:43:57,118 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 316 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:57,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 447 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:43:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-16 12:43:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 127. [2022-11-16 12:43:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 119 states have internal predecessors, (131), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:43:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2022-11-16 12:43:57,125 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 46 [2022-11-16 12:43:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:57,126 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2022-11-16 12:43:57,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:43:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2022-11-16 12:43:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:43:57,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:57,128 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:57,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:43:57,128 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1190116814, now seen corresponding path program 1 times [2022-11-16 12:43:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:57,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862900801] [2022-11-16 12:43:57,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:57,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:57,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:57,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:57,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:43:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:43:57,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:57,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862900801] [2022-11-16 12:43:57,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862900801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:57,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:57,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:43:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708368208] [2022-11-16 12:43:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:57,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:43:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:57,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:43:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:43:57,720 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:43:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:58,154 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2022-11-16 12:43:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:43:58,155 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-11-16 12:43:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:58,156 INFO L225 Difference]: With dead ends: 223 [2022-11-16 12:43:58,156 INFO L226 Difference]: Without dead ends: 223 [2022-11-16 12:43:58,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:43:58,157 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 541 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:58,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 457 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:43:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-16 12:43:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 130. [2022-11-16 12:43:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 122 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:43:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2022-11-16 12:43:58,164 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 46 [2022-11-16 12:43:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:58,164 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2022-11-16 12:43:58,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:43:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2022-11-16 12:43:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:43:58,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:58,167 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:58,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:43:58,167 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:43:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash 241903816, now seen corresponding path program 1 times [2022-11-16 12:43:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:58,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478968456] [2022-11-16 12:43:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:58,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:59,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:59,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:43:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:43:59,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:59,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478968456] [2022-11-16 12:43:59,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478968456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588894102] [2022-11-16 12:43:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:59,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:59,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:59,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:00,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:44:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:00,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-16 12:44:00,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:00,288 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-16 12:44:00,555 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:44:00,556 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-16 12:44:00,680 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-16 12:44:00,884 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:44:00,885 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 12:44:01,158 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:44:01,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-11-16 12:44:01,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:44:01,173 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 7 treesize of output 3 [2022-11-16 12:44:01,399 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1642) |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1641)))) is different from true [2022-11-16 12:44:01,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:01,483 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:44:01,484 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 45 treesize of output 43 [2022-11-16 12:44:01,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:01,498 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 14 treesize of output 16 [2022-11-16 12:44:01,532 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-16 12:44:01,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-16 12:44:01,637 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-16 12:44:01,832 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:44:01,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-11-16 12:44:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:44:01,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:44:02,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588894102] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:02,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:44:02,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-11-16 12:44:02,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585746268] [2022-11-16 12:44:02,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:44:02,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 12:44:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:02,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 12:44:02,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1924, Unknown=1, NotChecked=88, Total=2162 [2022-11-16 12:44:02,145 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:44:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:03,505 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2022-11-16 12:44:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:44:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-16 12:44:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:03,507 INFO L225 Difference]: With dead ends: 143 [2022-11-16 12:44:03,507 INFO L226 Difference]: Without dead ends: 143 [2022-11-16 12:44:03,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=259, Invalid=2936, Unknown=1, NotChecked=110, Total=3306 [2022-11-16 12:44:03,509 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 61 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 300 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:03,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1168 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 672 Invalid, 0 Unknown, 300 Unchecked, 0.6s Time] [2022-11-16 12:44:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-16 12:44:03,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2022-11-16 12:44:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 131 states have internal predecessors, (146), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:44:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2022-11-16 12:44:03,513 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 46 [2022-11-16 12:44:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:03,514 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2022-11-16 12:44:03,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:44:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2022-11-16 12:44:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:44:03,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:03,518 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:03,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:03,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 12:44:03,724 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:44:03,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash 241903817, now seen corresponding path program 1 times [2022-11-16 12:44:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:03,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875035288] [2022-11-16 12:44:03,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:05,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:05,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:05,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:44:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:44:06,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:06,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875035288] [2022-11-16 12:44:06,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875035288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:06,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092494315] [2022-11-16 12:44:06,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:06,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:06,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:06,111 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:06,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:44:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:06,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-16 12:44:06,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:06,409 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-16 12:44:06,786 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:44:06,786 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-16 12:44:06,935 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-16 12:44:06,960 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-16 12:44:07,190 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:44:07,191 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-16 12:44:07,203 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 18 treesize of output 20 [2022-11-16 12:44:07,526 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:44:07,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2022-11-16 12:44:07,538 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:44:07,831 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1819 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1819) |c_#memory_$Pointer$.offset|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1815 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1815) |c_#length|)) (exists ((v_ArrVal_1818 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1818))))) is different from true [2022-11-16 12:44:07,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:07,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:07,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:07,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 12:44:07,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:07,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2022-11-16 12:44:07,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:07,924 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:44:07,925 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 69 treesize of output 59 [2022-11-16 12:44:07,948 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 12:44:07,948 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 28 treesize of output 30 [2022-11-16 12:44:08,413 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-16 12:44:08,413 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 71 treesize of output 41 [2022-11-16 12:44:08,425 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:44:08,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-16 12:44:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:44:08,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:44:09,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092494315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:09,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:44:09,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2022-11-16 12:44:09,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897878278] [2022-11-16 12:44:09,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:44:09,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-16 12:44:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:09,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-16 12:44:09,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3121, Unknown=2, NotChecked=112, Total=3422 [2022-11-16 12:44:09,320 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:44:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:14,393 INFO L93 Difference]: Finished difference Result 282 states and 310 transitions. [2022-11-16 12:44:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:44:14,394 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-16 12:44:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:14,395 INFO L225 Difference]: With dead ends: 282 [2022-11-16 12:44:14,396 INFO L226 Difference]: Without dead ends: 282 [2022-11-16 12:44:14,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1506 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=444, Invalid=6038, Unknown=2, NotChecked=158, Total=6642 [2022-11-16 12:44:14,398 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 489 mSDsluCounter, 4136 mSDsCounter, 0 mSdLazyCounter, 4153 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 4288 SdHoareTripleChecker+Invalid, 4700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 519 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:14,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 4288 Invalid, 4700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4153 Invalid, 0 Unknown, 519 Unchecked, 2.8s Time] [2022-11-16 12:44:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-16 12:44:14,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 146. [2022-11-16 12:44:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 137 states have internal predecessors, (150), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:44:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2022-11-16 12:44:14,405 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 46 [2022-11-16 12:44:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:14,405 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2022-11-16 12:44:14,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:44:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2022-11-16 12:44:14,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 12:44:14,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:14,406 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:14,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:14,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:44:14,617 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:44:14,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:14,618 INFO L85 PathProgramCache]: Analyzing trace with hash 881645453, now seen corresponding path program 2 times [2022-11-16 12:44:14,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:14,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123770676] [2022-11-16 12:44:14,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:14,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:14,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:44:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:14,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:44:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-16 12:44:14,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:14,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123770676] [2022-11-16 12:44:14,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123770676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:14,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268632805] [2022-11-16 12:44:14,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:44:14,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:14,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:14,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:14,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:44:15,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:44:15,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:44:15,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:44:15,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:44:15,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:44:15,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268632805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:44:15,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:44:15,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-16 12:44:15,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620254846] [2022-11-16 12:44:15,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:44:15,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:44:15,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:44:15,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:44:15,077 INFO L87 Difference]: Start difference. First operand 146 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:44:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:15,095 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-11-16 12:44:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:44:15,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-11-16 12:44:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:15,096 INFO L225 Difference]: With dead ends: 123 [2022-11-16 12:44:15,097 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 12:44:15,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:44:15,098 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 174 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:15,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 116 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:44:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 12:44:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-11-16 12:44:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:44:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2022-11-16 12:44:15,102 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 49 [2022-11-16 12:44:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:15,103 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2022-11-16 12:44:15,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:44:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-11-16 12:44:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 12:44:15,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:15,104 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:15,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:15,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:15,311 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:44:15,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash 185060511, now seen corresponding path program 1 times [2022-11-16 12:44:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:15,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104449540] [2022-11-16 12:44:15,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:15,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:15,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:15,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:15,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:44:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-16 12:44:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:15,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104449540] [2022-11-16 12:44:15,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104449540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:44:15,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:44:15,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:44:15,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136720699] [2022-11-16 12:44:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:44:15,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:44:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:15,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:44:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:44:15,516 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:44:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:15,781 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2022-11-16 12:44:15,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:44:15,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-11-16 12:44:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:15,782 INFO L225 Difference]: With dead ends: 166 [2022-11-16 12:44:15,783 INFO L226 Difference]: Without dead ends: 166 [2022-11-16 12:44:15,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:44:15,783 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 155 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:15,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 414 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:44:15,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-16 12:44:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 123. [2022-11-16 12:44:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.372340425531915) internal successors, (129), 117 states have internal predecessors, (129), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:44:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2022-11-16 12:44:15,787 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 49 [2022-11-16 12:44:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:15,788 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2022-11-16 12:44:15,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:44:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2022-11-16 12:44:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 12:44:15,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:15,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:15,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 12:44:15,791 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:44:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash 185060512, now seen corresponding path program 1 times [2022-11-16 12:44:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:15,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511401729] [2022-11-16 12:44:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:16,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:44:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:44:16,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:16,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511401729] [2022-11-16 12:44:16,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511401729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:44:16,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:44:16,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 12:44:16,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363154864] [2022-11-16 12:44:16,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:44:16,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:44:16,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:16,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:44:16,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:44:16,477 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:44:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:17,053 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2022-11-16 12:44:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:44:17,055 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-11-16 12:44:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:17,056 INFO L225 Difference]: With dead ends: 184 [2022-11-16 12:44:17,056 INFO L226 Difference]: Without dead ends: 184 [2022-11-16 12:44:17,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:44:17,057 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 404 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:17,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 625 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:44:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-16 12:44:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 131. [2022-11-16 12:44:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.392156862745098) internal successors, (142), 125 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:44:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2022-11-16 12:44:17,061 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 49 [2022-11-16 12:44:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:17,061 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2022-11-16 12:44:17,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:44:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2022-11-16 12:44:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:44:17,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:17,068 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:17,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 12:44:17,068 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:44:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:17,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1749494887, now seen corresponding path program 1 times [2022-11-16 12:44:17,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:17,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999827619] [2022-11-16 12:44:17,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:17,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:17,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:17,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:44:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:44:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:17,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999827619] [2022-11-16 12:44:17,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999827619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:17,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839920212] [2022-11-16 12:44:17,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:17,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:17,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:17,631 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:17,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:44:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:17,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 12:44:17,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:18,146 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 8 treesize of output 4 [2022-11-16 12:44:18,218 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2438 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2438)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:44:18,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:18,241 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 15 treesize of output 17 [2022-11-16 12:44:18,276 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 16 treesize of output 8 [2022-11-16 12:44:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 12:44:18,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:44:18,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839920212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:18,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:44:18,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-16 12:44:18,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440498355] [2022-11-16 12:44:18,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:44:18,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 12:44:18,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:18,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 12:44:18,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=613, Unknown=6, NotChecked=50, Total=756 [2022-11-16 12:44:18,403 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:44:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:18,992 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-11-16 12:44:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:44:18,992 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-16 12:44:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:18,998 INFO L225 Difference]: With dead ends: 112 [2022-11-16 12:44:18,998 INFO L226 Difference]: Without dead ends: 112 [2022-11-16 12:44:18,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=955, Unknown=6, NotChecked=64, Total=1190 [2022-11-16 12:44:18,999 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 278 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:18,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 827 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 470 Invalid, 0 Unknown, 99 Unchecked, 0.3s Time] [2022-11-16 12:44:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-16 12:44:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-16 12:44:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 106 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:44:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-11-16 12:44:19,003 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 51 [2022-11-16 12:44:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:19,004 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-11-16 12:44:19,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:44:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-11-16 12:44:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:44:19,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:19,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:19,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:19,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 12:44:19,212 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:44:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash -720045115, now seen corresponding path program 2 times [2022-11-16 12:44:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:19,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518332197] [2022-11-16 12:44:19,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:20,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:20,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:20,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:44:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:44:21,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:21,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518332197] [2022-11-16 12:44:21,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518332197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:21,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744188211] [2022-11-16 12:44:21,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:44:21,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:21,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:21,054 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:21,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:44:21,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:44:21,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:44:21,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 139 conjunts are in the unsatisfiable core [2022-11-16 12:44:21,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:21,427 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-16 12:44:21,814 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:44:21,814 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-16 12:44:21,974 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-16 12:44:21,981 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-16 12:44:22,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:44:22,183 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:44:22,184 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-11-16 12:44:22,192 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 18 treesize of output 20 [2022-11-16 12:44:22,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:22,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:22,880 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:44:22,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2022-11-16 12:44:22,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:44:22,932 INFO L321 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-11-16 12:44:22,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 70 [2022-11-16 12:44:22,957 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-16 12:44:22,957 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 20 treesize of output 22 [2022-11-16 12:44:24,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:24,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:24,539 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:44:24,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 30 [2022-11-16 12:44:24,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:44:24,931 INFO L321 Elim1Store]: treesize reduction 60, result has 21.1 percent of original size [2022-11-16 12:44:24,931 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 48 [2022-11-16 12:44:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:44:25,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:44:25,297 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-11-16 12:44:25,297 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 24 treesize of output 23 [2022-11-16 12:44:28,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744188211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:28,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:44:28,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2022-11-16 12:44:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754178262] [2022-11-16 12:44:28,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:44:28,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-16 12:44:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-16 12:44:28,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=4302, Unknown=4, NotChecked=0, Total=4556 [2022-11-16 12:44:28,174 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 59 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 52 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:44:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:30,619 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2022-11-16 12:44:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 12:44:30,620 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 52 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-11-16 12:44:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:30,620 INFO L225 Difference]: With dead ends: 117 [2022-11-16 12:44:30,620 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 12:44:30,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2113 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=407, Invalid=6561, Unknown=4, NotChecked=0, Total=6972 [2022-11-16 12:44:30,623 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:30,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2013 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1137 Invalid, 0 Unknown, 199 Unchecked, 0.8s Time] [2022-11-16 12:44:30,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 12:44:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2022-11-16 12:44:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 85 states have (on average 1.4) internal successors, (119), 108 states have internal predecessors, (119), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:44:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2022-11-16 12:44:30,630 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 51 [2022-11-16 12:44:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:30,630 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2022-11-16 12:44:30,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 52 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:44:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2022-11-16 12:44:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:44:30,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:30,631 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:30,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:30,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 12:44:30,838 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:44:30,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:30,838 INFO L85 PathProgramCache]: Analyzing trace with hash -720045114, now seen corresponding path program 2 times [2022-11-16 12:44:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:30,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113579287] [2022-11-16 12:44:30,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:32,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:44:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:44:32,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:32,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113579287] [2022-11-16 12:44:32,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113579287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:32,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572121815] [2022-11-16 12:44:32,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:44:32,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:32,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:32,992 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:32,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:44:33,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:44:33,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:44:33,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-16 12:44:33,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:33,313 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-16 12:44:33,704 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:44:33,704 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-16 12:44:33,875 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-16 12:44:33,882 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-16 12:44:34,086 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:44:34,087 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-11-16 12:44:34,094 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 27 treesize of output 22 [2022-11-16 12:44:34,784 INFO L321 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-11-16 12:44:34,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 77 [2022-11-16 12:44:34,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:34,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:34,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:34,805 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 12:44:34,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2022-11-16 12:44:34,833 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-16 12:44:34,833 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 20 treesize of output 22 [2022-11-16 12:44:36,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:44:36,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:44:36,774 INFO L321 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2022-11-16 12:44:36,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 109 treesize of output 73 [2022-11-16 12:44:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:44:37,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:44:40,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572121815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:40,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:44:40,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2022-11-16 12:44:40,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096422059] [2022-11-16 12:44:40,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:44:40,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-16 12:44:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:40,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-16 12:44:40,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4167, Unknown=6, NotChecked=0, Total=4422 [2022-11-16 12:44:40,860 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:44:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:44,219 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-11-16 12:44:44,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 12:44:44,219 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-11-16 12:44:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:44,220 INFO L225 Difference]: With dead ends: 102 [2022-11-16 12:44:44,220 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 12:44:44,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=422, Invalid=6378, Unknown=6, NotChecked=0, Total=6806 [2022-11-16 12:44:44,223 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 44 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:44,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1633 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 785 Invalid, 0 Unknown, 90 Unchecked, 0.6s Time] [2022-11-16 12:44:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 12:44:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-11-16 12:44:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.355263157894737) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:44:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2022-11-16 12:44:44,227 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 51 [2022-11-16 12:44:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:44,227 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2022-11-16 12:44:44,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:44:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-11-16 12:44:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 12:44:44,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:44,228 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:44,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:44,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:44,434 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:44:44,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1242536311, now seen corresponding path program 1 times [2022-11-16 12:44:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:44,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64782803] [2022-11-16 12:44:44,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:45,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:45,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:44:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:44:45,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:45,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64782803] [2022-11-16 12:44:45,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64782803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:45,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337991335] [2022-11-16 12:44:45,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:45,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:45,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:45,659 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:45,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:44:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:45,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 12:44:45,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:46,409 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 17 treesize of output 9 [2022-11-16 12:44:46,412 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-16 12:44:46,803 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-16 12:44:46,803 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 21 treesize of output 29 [2022-11-16 12:44:46,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:46,810 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 31 [2022-11-16 12:44:47,316 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:44:47,317 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-11-16 12:44:47,451 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:44:47,452 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 50 treesize of output 46 [2022-11-16 12:44:47,556 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 26 treesize of output 14 [2022-11-16 12:44:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:44:47,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:44:47,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337991335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:44:47,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:44:47,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [23] total 41 [2022-11-16 12:44:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36008482] [2022-11-16 12:44:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:44:47,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 12:44:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:47,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 12:44:47,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1598, Unknown=1, NotChecked=0, Total=1722 [2022-11-16 12:44:47,563 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:44:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:48,325 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2022-11-16 12:44:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:44:48,325 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-11-16 12:44:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:48,326 INFO L225 Difference]: With dead ends: 179 [2022-11-16 12:44:48,326 INFO L226 Difference]: Without dead ends: 179 [2022-11-16 12:44:48,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=195, Invalid=2156, Unknown=1, NotChecked=0, Total=2352 [2022-11-16 12:44:48,327 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 247 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:48,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 606 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 536 Invalid, 0 Unknown, 118 Unchecked, 0.4s Time] [2022-11-16 12:44:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-16 12:44:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 111. [2022-11-16 12:44:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 105 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:44:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2022-11-16 12:44:48,331 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 53 [2022-11-16 12:44:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:48,332 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2022-11-16 12:44:48,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:44:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2022-11-16 12:44:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 12:44:48,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:48,333 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:48,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:48,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:48,540 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:44:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1242536312, now seen corresponding path program 1 times [2022-11-16 12:44:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:48,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228756176] [2022-11-16 12:44:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:49,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:49,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:44:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:44:49,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:49,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228756176] [2022-11-16 12:44:49,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228756176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:49,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412660192] [2022-11-16 12:44:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:49,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:49,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:49,959 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:49,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:44:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:50,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 12:44:50,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:50,692 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 7 treesize of output 3 [2022-11-16 12:44:50,776 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3171 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_3171)))) is different from true [2022-11-16 12:44:50,783 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3172 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_3172) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:44:50,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:50,874 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 16 treesize of output 18 [2022-11-16 12:44:51,286 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:44:51,286 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-11-16 12:44:51,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:51,295 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 33 [2022-11-16 12:44:51,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:51,407 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 31 [2022-11-16 12:44:51,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:51,416 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 29 treesize of output 29 [2022-11-16 12:44:51,547 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 32 treesize of output 20 [2022-11-16 12:44:51,550 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 26 treesize of output 14 [2022-11-16 12:44:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-16 12:44:51,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:44:52,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:44:52,103 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 50 treesize of output 54 [2022-11-16 12:44:52,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:44:52,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 248 [2022-11-16 12:44:52,574 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 232 treesize of output 224 [2022-11-16 12:44:52,581 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 224 treesize of output 220 [2022-11-16 12:44:52,588 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 220 treesize of output 216 [2022-11-16 12:44:52,595 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 216 treesize of output 214 [2022-11-16 12:44:52,928 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (< |c_#StackHeapBarrier| (+ 1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((|v_node_create_~temp~0#1.base_49| Int)) (or (forall ((v_ArrVal_3180 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_49| v_ArrVal_3180) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_main_~#s~0#1.base|))) (not (< |v_node_create_~temp~0#1.base_49| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-16 12:44:52,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412660192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:52,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:44:52,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 48 [2022-11-16 12:44:52,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145427615] [2022-11-16 12:44:52,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:44:52,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 12:44:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 12:44:52,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2679, Unknown=30, NotChecked=318, Total=3192 [2022-11-16 12:44:52,940 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 42 states have internal predecessors, (92), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:44:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:55,496 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-11-16 12:44:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 12:44:55,497 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 42 states have internal predecessors, (92), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2022-11-16 12:44:55,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:55,498 INFO L225 Difference]: With dead ends: 100 [2022-11-16 12:44:55,498 INFO L226 Difference]: Without dead ends: 100 [2022-11-16 12:44:55,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=384, Invalid=5146, Unknown=32, NotChecked=444, Total=6006 [2022-11-16 12:44:55,500 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 178 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:55,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1129 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1122 Invalid, 0 Unknown, 242 Unchecked, 0.9s Time] [2022-11-16 12:44:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-16 12:44:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-16 12:44:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:44:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-11-16 12:44:55,510 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 53 [2022-11-16 12:44:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:55,510 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-11-16 12:44:55,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 42 states have internal predecessors, (92), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:44:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-11-16 12:44:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:44:55,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:55,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:55,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-16 12:44:55,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:55,712 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:44:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1012998182, now seen corresponding path program 1 times [2022-11-16 12:44:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:55,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233416229] [2022-11-16 12:44:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:55,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:57,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:57,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:44:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:44:57,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:57,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233416229] [2022-11-16 12:44:57,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233416229] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:57,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94703625] [2022-11-16 12:44:57,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:57,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:57,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:57,880 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:57,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 12:44:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:58,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-16 12:44:58,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:58,794 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 9 treesize of output 5 [2022-11-16 12:44:58,799 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-16 12:44:59,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:59,301 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 21 [2022-11-16 12:44:59,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:59,314 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 16 treesize of output 18 [2022-11-16 12:44:59,335 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-16 12:44:59,335 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 21 treesize of output 29 [2022-11-16 12:45:00,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:45:00,111 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 26 treesize of output 26 [2022-11-16 12:45:00,356 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:45:00,356 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 32 [2022-11-16 12:45:00,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:45:00,606 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 12:45:00,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 58 [2022-11-16 12:45:00,659 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-16 12:45:00,918 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 69 treesize of output 45 [2022-11-16 12:45:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:45:01,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:45:01,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3366 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3366) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-16 12:45:12,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94703625] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:45:12,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:45:12,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 25] total 57 [2022-11-16 12:45:12,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444332579] [2022-11-16 12:45:12,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:45:12,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-16 12:45:12,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:45:12,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-16 12:45:12,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=4124, Unknown=33, NotChecked=130, Total=4556 [2022-11-16 12:45:12,737 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 58 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 51 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:45:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:45:24,466 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-11-16 12:45:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 12:45:24,467 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 51 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 58 [2022-11-16 12:45:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:45:24,468 INFO L225 Difference]: With dead ends: 101 [2022-11-16 12:45:24,468 INFO L226 Difference]: Without dead ends: 101 [2022-11-16 12:45:24,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=542, Invalid=7079, Unknown=39, NotChecked=172, Total=7832 [2022-11-16 12:45:24,470 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 93 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:45:24,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1651 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1231 Invalid, 0 Unknown, 115 Unchecked, 1.0s Time] [2022-11-16 12:45:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-16 12:45:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-16 12:45:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:45:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2022-11-16 12:45:24,475 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 58 [2022-11-16 12:45:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:45:24,475 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2022-11-16 12:45:24,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 51 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:45:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-11-16 12:45:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:45:24,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:45:24,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:45:24,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:45:24,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 12:45:24,684 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:45:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:45:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1012998181, now seen corresponding path program 1 times [2022-11-16 12:45:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:45:24,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345714073] [2022-11-16 12:45:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:45:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:45:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:26,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:45:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:26,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:45:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:45:27,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:45:27,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345714073] [2022-11-16 12:45:27,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345714073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:45:27,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309132434] [2022-11-16 12:45:27,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:45:27,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:45:27,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:45:27,431 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:45:27,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 12:45:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:45:27,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-16 12:45:27,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:45:27,769 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-16 12:45:27,853 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-16 12:45:27,911 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3555 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3555))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:45:27,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:45:27,957 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:45:27,979 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-16 12:45:28,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:45:28,203 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:45:28,656 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-16 12:45:28,661 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 7 treesize of output 3 [2022-11-16 12:45:29,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:45:29,256 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:45:29,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:45:29,271 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 14 treesize of output 16 [2022-11-16 12:45:30,836 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-16 12:45:30,836 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 86 [2022-11-16 12:45:30,870 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-16 12:45:30,870 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 55 [2022-11-16 12:45:31,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:45:31,236 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 12:45:31,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 108 [2022-11-16 12:45:31,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:45:31,331 INFO L321 Elim1Store]: treesize reduction 66, result has 50.7 percent of original size [2022-11-16 12:45:31,331 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 9 case distinctions, treesize of input 114 treesize of output 151 [2022-11-16 12:45:31,411 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-16 12:45:32,271 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-16 12:45:32,783 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:45:32,783 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2022-11-16 12:45:32,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-11-16 12:45:33,490 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-16 12:45:33,680 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 46 treesize of output 36 [2022-11-16 12:45:36,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:45:36,642 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 256 treesize of output 187 [2022-11-16 12:45:36,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:45:36,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 207 [2022-11-16 12:45:37,136 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 7 [2022-11-16 12:45:37,325 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 7 [2022-11-16 12:45:37,556 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-16 12:45:37,594 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 12:45:37,735 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 7 [2022-11-16 12:45:37,774 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 7 [2022-11-16 12:45:37,813 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:45:37,814 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 18 treesize of output 10 [2022-11-16 12:45:37,850 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 12:45:37,851 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 80 treesize of output 72 [2022-11-16 12:45:37,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:45:37,948 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 94 treesize of output 96 [2022-11-16 12:45:38,256 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 12:45:38,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:45:38,409 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 94 treesize of output 96 [2022-11-16 12:45:38,513 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 12:45:38,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:45:38,973 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 859 treesize of output 766 [2022-11-16 12:45:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-16 12:45:45,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:45:52,764 INFO L321 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-11-16 12:45:52,765 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 161 [2022-11-16 12:45:52,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:45:52,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 208 [2022-11-16 12:45:52,845 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 132 treesize of output 130 [2022-11-16 12:45:58,104 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse19 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse0)) (let ((.cse22 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) .cse0))) (let ((.cse30 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse46 (+ .cse22 4)) (.cse10 (+ 4 .cse0))) (let ((.cse51 (forall ((v_arrayElimCell_190 Int)) (let ((.cse75 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse75)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse75) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse75 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse75 4) (select |c_#length| v_subst_2))))))))) (.cse20 (select |c_#length| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse47 (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= .cse46 (select |c_#length| v_subst_2)))))) (.cse18 (select |c_#length| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (.cse37 (forall ((v_arrayElimCell_190 Int)) (let ((.cse74 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse74)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse74 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse74 4) (select |c_#length| v_subst_2))))))))) (.cse11 (not .cse30))) (let ((.cse13 (and (forall ((v_arrayElimCell_190 Int)) (let ((.cse70 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (forall ((v_subst_1 Int)) (or (not (<= (+ .cse70 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int)) (v_arrayElimCell_191 Int)) (let ((.cse71 (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse70 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse71 (select |c_#length| v_arrayElimCell_191)) (forall ((v_arrayElimCell_194 Int)) (<= .cse71 (select |c_#length| v_arrayElimCell_194)))))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (not (<= 0 .cse70)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190)))))) (or .cse30 (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_191 Int) (v_arrayElimCell_190 Int)) (let ((.cse72 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse72)) (not (<= (+ .cse72 4) (select |c_#length| v_subst_1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse72 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_191)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse37 (or (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse73 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse73)) (not (<= (+ .cse73 4) (select |c_#length| v_subst_1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse73 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse11))) (.cse8 (and (or (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (or (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (not (<= .cse46 (select |c_#length| v_subst_1))))) .cse11) (or .cse30 (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (or (not (<= .cse46 (select |c_#length| v_subst_1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse18)))) .cse47 (forall ((v_subst_1 Int)) (or (forall ((v_prenex_195 (Array Int Int))) (let ((.cse69 (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse69 (select |c_#length| v_arrayElimCell_194))) (<= .cse69 .cse18)))) (not (<= .cse46 (select |c_#length| v_subst_1))))))) (.cse1 (forall ((v_arrayElimCell_190 Int)) (let ((.cse68 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse68)) (not (= .cse68 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse68 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse68 4) (select |c_#length| v_subst_2))))))))) (.cse2 (forall ((v_arrayElimCell_190 Int)) (let ((.cse66 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse66)) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse67 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse19 .cse66 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse67 (select |c_#length| v_arrayElimCell_194))) (<= .cse67 .cse18)))) (not (= .cse66 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse66 4) .cse20)))))) (.cse3 (or .cse30 (forall ((v_prenex_195 (Array Int Int)) (v_arrayElimCell_190 Int)) (let ((.cse65 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse65)) (not (= .cse65 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse65 4) .cse20)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse19 .cse65 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse18)))))) (.cse12 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse45 (and (or (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse61 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse61)) (not (<= (+ .cse61 4) (select |c_#length| v_subst_1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse61 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190)))))) .cse11) (or .cse30 (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse62 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse62)) (not (<= (+ .cse62 4) (select |c_#length| v_subst_1))) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse62 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse18))))) .cse37 (forall ((v_arrayElimCell_190 Int)) (let ((.cse63 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse63)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse63 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse64 (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse63 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse64 (select |c_#length| v_arrayElimCell_194))) (<= .cse64 .cse18))))))))))) (.cse4 (or .cse11 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_arrayElimCell_190 Int)) (let ((.cse60 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse60)) (not (= .cse60 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse60 4) .cse20)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse19 .cse60 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194))))))) (.cse6 (not (<= .cse10 .cse18))) (.cse7 (not (<= 0 .cse22))) (.cse5 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse14 (and (forall ((v_arrayElimCell_190 Int)) (let ((.cse56 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse56)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse56 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int)) (v_arrayElimCell_191 Int)) (let ((.cse57 (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse56 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse57 (select |c_#length| v_arrayElimCell_191)) (forall ((v_arrayElimCell_194 Int)) (<= .cse57 (select |c_#length| v_arrayElimCell_194)))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse56)))) (or (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_191 Int) (v_arrayElimCell_190 Int)) (let ((.cse58 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse58)) (not (<= (+ .cse58 4) (select |c_#length| v_subst_1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse58 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_191)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse58)))) .cse30) .cse51 (or (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse59 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse59)) (not (<= (+ .cse59 4) (select |c_#length| v_subst_1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse59 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse59)))) .cse11)))) (and (or (and .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse6 .cse7 .cse8) (or (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse9)) (not (<= (+ .cse9 4) (select |c_#length| v_subst_1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse9 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse9) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1)))) .cse11) (or .cse12 .cse13) (or .cse12 .cse14) (or (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse15)) (not (<= (+ .cse15 4) (select |c_#length| v_subst_1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse15 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1)))) .cse11) (or .cse13 .cse5) (forall ((v_arrayElimCell_190 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse16)) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse17 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse19 .cse16 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse17 (select |c_#length| v_arrayElimCell_194))) (<= .cse17 .cse18)))) (not (= .cse16 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse16 4) .cse20)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse16)))) (or (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_arrayElimCell_190 Int)) (let ((.cse21 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse21)) (not (= .cse21 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse21 4) .cse20)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse19 .cse21 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse21)))) .cse11) (or .cse6 (= .cse22 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse7 .cse8) .cse1 (forall ((v_arrayElimCell_190 Int)) (let ((.cse25 (select |c_#length| v_arrayElimCell_190)) (.cse23 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse23)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse23 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse24 (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse23 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse24 .cse25) (forall ((v_arrayElimCell_194 Int)) (<= .cse24 (select |c_#length| v_arrayElimCell_194)))))))) (not (<= .cse10 .cse25)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse23) (= .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (or (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse26)) (not (<= (+ .cse26 4) (select |c_#length| v_subst_1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse26 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse26 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) .cse11) (forall ((v_arrayElimCell_190 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse27)) (not (= .cse27 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse27) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse27 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse27 4) (select |c_#length| v_subst_2)))))))) (or (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse28 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0)) (.cse29 (select |c_#length| v_arrayElimCell_190))) (or (not (<= 0 .cse28)) (not (<= (+ .cse28 4) (select |c_#length| v_subst_1))) (not (<= .cse10 .cse29)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse28 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse29) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1)))) .cse30) (or (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse32 (select |c_#length| v_arrayElimCell_190)) (.cse31 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse31)) (not (<= (+ .cse31 4) (select |c_#length| v_subst_1))) (not (<= .cse10 .cse32)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse31 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse32) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse31 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) .cse30) .cse2 (forall ((v_arrayElimCell_190 Int)) (let ((.cse34 (select |c_#length| v_arrayElimCell_190)) (.cse33 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse33)) (not (<= .cse10 .cse34)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse33) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse33 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse35 (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse33 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse35 .cse34) (forall ((v_arrayElimCell_194 Int)) (<= .cse35 (select |c_#length| v_arrayElimCell_194)))))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1)))))) (forall ((v_arrayElimCell_190 Int)) (let ((.cse36 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse36)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse36 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse36 4) (select |c_#length| v_subst_2))))) (= .cse36 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) .cse37 (forall ((v_arrayElimCell_190 Int)) (let ((.cse39 (select |c_#length| v_arrayElimCell_190)) (.cse38 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse38)) (not (<= .cse10 .cse39)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse38 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse40 (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse38 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse40 .cse39) (forall ((v_arrayElimCell_194 Int)) (<= .cse40 (select |c_#length| v_arrayElimCell_194)))))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (= .cse38 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (forall ((v_arrayElimCell_190 Int)) (let ((.cse41 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0)) (.cse43 (select |c_#length| v_arrayElimCell_190))) (or (not (<= 0 .cse41)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse41 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse42 (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse41 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse42 .cse43) (forall ((v_arrayElimCell_194 Int)) (<= .cse42 (select |c_#length| v_arrayElimCell_194)))))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1))) (not (<= .cse10 .cse43))))) (forall ((v_arrayElimCell_190 Int)) (let ((.cse44 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse44)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse44) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse44 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse44 4) (select |c_#length| v_subst_2))))) (= .cse44 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (or .cse5 .cse45) .cse3 (or .cse12 .cse45) .cse4 (or .cse6 (and (or .cse30 (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (or (not (<= .cse46 (select |c_#length| v_subst_1))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse18)))) (or (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (or (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (not (<= .cse46 (select |c_#length| v_subst_1))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|))) .cse11) .cse47 (forall ((v_subst_1 Int)) (or (forall ((v_prenex_195 (Array Int Int))) (let ((.cse48 (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse22 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse48 (select |c_#length| v_arrayElimCell_194))) (<= .cse48 .cse18)))) (not (<= .cse46 (select |c_#length| v_subst_1))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|)))) .cse7) (or .cse30 (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse50 (select |c_#length| v_arrayElimCell_190)) (.cse49 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse49)) (not (<= (+ .cse49 4) (select |c_#length| v_subst_1))) (not (<= .cse10 .cse50)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse49 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse50) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse49) (= .cse49 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) .cse51 (or .cse5 .cse14) (or (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse53 (select |c_#length| v_arrayElimCell_190)) (.cse52 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse52)) (not (<= (+ .cse52 4) (select |c_#length| v_subst_1))) (not (<= .cse10 .cse53)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse52 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse53) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse52) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1)))) .cse30) (or (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse54 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse54)) (not (<= (+ .cse54 4) (select |c_#length| v_subst_1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse54 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse54) (= .cse54 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) .cse11) (or .cse30 (forall ((v_prenex_195 (Array Int Int)) (v_arrayElimCell_190 Int)) (let ((.cse55 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse0))) (or (not (<= 0 .cse55)) (not (= .cse55 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse10 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse55 4) .cse20)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse55) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse19 .cse55 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse18)))))))))) (not (<= 0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))) is different from true [2022-11-16 12:46:02,328 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (let ((.cse46 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) .cse4))) (let ((.cse5 (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (+ 4 .cse4)) (.cse53 (+ .cse46 4))) (let ((.cse55 (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (not (<= .cse53 (select |c_#length| v_subst_2))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse46 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (.cse24 (forall ((v_arrayElimCell_190 Int)) (let ((.cse75 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse75)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse75 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse75 4) (select |c_#length| v_subst_2))))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))))))) (.cse0 (forall ((v_arrayElimCell_190 Int)) (let ((.cse74 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse74)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse74 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse74 4) (select |c_#length| v_subst_2))))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse74))))) (.cse20 (not .cse5)) (.cse8 (select |c_#length| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse9 (select |c_#length| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse10 (forall ((v_arrayElimCell_190 Int)) (let ((.cse73 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse73)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse73 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse73 4) (select |c_#length| v_subst_2))))) (not (= .cse73 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))))))) (.cse27 (or (forall ((v_prenex_195 (Array Int Int)) (v_arrayElimCell_190 Int)) (let ((.cse72 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse72)) (not (= .cse72 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse7 .cse72 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse8) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse72 4) .cse9))))) .cse5)) (.cse11 (and .cse0 (forall ((v_arrayElimCell_190 Int)) (let ((.cse68 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse68)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse68 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int)) (v_arrayElimCell_191 Int)) (let ((.cse69 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse68 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse69 (select |c_#length| v_arrayElimCell_194))) (<= .cse69 (select |c_#length| v_arrayElimCell_191))))))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse68)))) (or (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_191 Int) (v_arrayElimCell_190 Int)) (let ((.cse70 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse70)) (not (<= (+ .cse70 4) (select |c_#length| v_subst_1))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse70) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse70 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_191))))) .cse5) (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse71 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse71)) (not (<= (+ .cse71 4) (select |c_#length| v_subst_1))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse71) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse71 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_194)))))))) (.cse28 (forall ((v_arrayElimCell_190 Int)) (let ((.cse67 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (forall ((v_prenex_195 (Array Int Int))) (let ((.cse66 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse7 .cse67 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse66 (select |c_#length| v_arrayElimCell_194))) (<= .cse66 .cse8)))) (not (<= 0 .cse67)) (not (= .cse67 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse67 4) .cse9)))))) (.cse15 (and (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse62 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse62)) (not (<= (+ .cse62 4) (select |c_#length| v_subst_1))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse62 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_194)))))) (or .cse5 (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse63 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse63)) (not (<= (+ .cse63 4) (select |c_#length| v_subst_1))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse63 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse8))))) (forall ((v_arrayElimCell_190 Int)) (let ((.cse64 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse64)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse64 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse65 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse64 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse65 (select |c_#length| v_arrayElimCell_194))) (<= .cse65 .cse8)))))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190)))))) .cse24)) (.cse31 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse29 (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_arrayElimCell_190 Int)) (let ((.cse61 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse61)) (not (= .cse61 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse61 4) .cse9)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse7 .cse61 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194))))))) (.cse48 (and (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (or (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse46 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_194)) (not (<= .cse53 (select |c_#length| v_subst_1)))))) (or .cse5 (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (or (not (<= .cse53 (select |c_#length| v_subst_1))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse46 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse8)))) (forall ((v_subst_1 Int)) (or (not (<= .cse53 (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse60 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse46 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse60 (select |c_#length| v_arrayElimCell_194))) (<= .cse60 .cse8)))))) .cse55)) (.cse38 (and .cse24 (forall ((v_arrayElimCell_190 Int)) (let ((.cse56 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse56)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse56 4) (select |c_#length| v_subst_1))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_prenex_195 (Array Int Int)) (v_arrayElimCell_191 Int)) (let ((.cse57 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse56 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse57 (select |c_#length| v_arrayElimCell_194))) (<= .cse57 (select |c_#length| v_arrayElimCell_191))))))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190)))))) (or .cse5 (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_191 Int) (v_arrayElimCell_190 Int)) (let ((.cse58 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse58)) (not (<= (+ .cse58 4) (select |c_#length| v_subst_1))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse58 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_191)))))) (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse59 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse59)) (not (<= (+ .cse59 4) (select |c_#length| v_subst_1))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse59 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_194)))))))) (.cse12 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse45 (not (<= .cse2 .cse8))) (.cse47 (not (<= 0 .cse46)))) (and .cse0 (or (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4)) (.cse3 (select |c_#length| v_arrayElimCell_190))) (or (not (<= 0 .cse1)) (not (<= (+ .cse1 4) (select |c_#length| v_subst_1))) (not (<= .cse2 .cse3)) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1)))) .cse5) (or (forall ((v_prenex_195 (Array Int Int)) (v_arrayElimCell_190 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse6)) (not (= .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse7 .cse6 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse8) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse6 4) .cse9)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse6)))) .cse5) .cse10 (or .cse11 .cse12) (or (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse14 (select |c_#length| v_arrayElimCell_190)) (.cse13 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse13)) (not (<= (+ .cse13 4) (select |c_#length| v_subst_1))) (not (<= .cse2 .cse14)) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse13 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse14) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse13) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1)))) .cse5) (or .cse15 .cse12) (forall ((v_arrayElimCell_190 Int)) (let ((.cse17 (select |c_#length| v_arrayElimCell_190)) (.cse16 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse16)) (not (<= .cse2 .cse17)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse16 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse18 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse16 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse18 (select |c_#length| v_arrayElimCell_194))) (<= .cse18 .cse17)))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1)))))) (forall ((v_arrayElimCell_190 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse19)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse19 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse19 4) (select |c_#length| v_subst_2))))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= .cse19 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse21 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse21)) (not (<= (+ .cse21 4) (select |c_#length| v_subst_1))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse21 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_194)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1))))) (or (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse23 (select |c_#length| v_arrayElimCell_190)) (.cse22 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse22)) (not (<= (+ .cse22 4) (select |c_#length| v_subst_1))) (not (<= .cse2 .cse23)) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse22 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse23) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse22) (= .cse22 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) .cse5) .cse24 (or .cse5 (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse26 (select |c_#length| v_arrayElimCell_190)) (.cse25 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse25)) (not (<= (+ .cse25 4) (select |c_#length| v_subst_1))) (not (<= .cse2 .cse26)) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse25 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse26) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse25 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) .cse27 (or (and .cse10 .cse27 .cse28 .cse29) .cse12) (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse30 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse30)) (not (<= (+ .cse30 4) (select |c_#length| v_subst_1))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse30) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse30 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_194)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1))))) (or .cse31 .cse11) .cse28 (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse32 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse32)) (not (<= (+ .cse32 4) (select |c_#length| v_subst_1))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse32 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_194)) (= .cse32 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_arrayElimCell_190 Int)) (let ((.cse33 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse33)) (not (= .cse33 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse33 4) .cse9)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse7 .cse33 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| v_arrayElimCell_194)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse33))))) (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse34 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse34)) (not (<= (+ .cse34 4) (select |c_#length| v_subst_1))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse34) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse34 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_194)) (= .cse34 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (forall ((v_arrayElimCell_190 Int)) (let ((.cse35 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse35)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse35 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse35 4) (select |c_#length| v_subst_2))))) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse35) (= .cse35 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (forall ((v_arrayElimCell_190 Int)) (let ((.cse37 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (forall ((v_prenex_195 (Array Int Int))) (let ((.cse36 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse7 .cse37 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse36 (select |c_#length| v_arrayElimCell_194))) (<= .cse36 .cse8)))) (not (<= 0 .cse37)) (not (= .cse37 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (not (<= (+ .cse37 4) .cse9)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse37)))) (or .cse15 .cse31) (or .cse31 .cse38) (forall ((v_arrayElimCell_190 Int)) (let ((.cse40 (select |c_#length| v_arrayElimCell_190)) (.cse39 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse39)) (not (<= .cse2 .cse40)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse39 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse41 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse39 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse41 (select |c_#length| v_arrayElimCell_194))) (<= .cse41 .cse40)))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (= .cse39 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (forall ((v_arrayElimCell_190 Int)) (let ((.cse43 (select |c_#length| v_arrayElimCell_190)) (.cse42 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse42)) (not (<= .cse2 .cse43)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse42 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse44 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse42 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse44 (select |c_#length| v_arrayElimCell_194))) (<= .cse44 .cse43)))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse42)))) (or .cse45 (= .cse46 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse47 .cse48) .cse29 (forall ((v_arrayElimCell_190 Int)) (let ((.cse49 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse49)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_2 (store (select |c_#memory_$Pointer$.offset| v_subst_2) .cse49 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse49 4) (select |c_#length| v_subst_2))))) (not (= .cse49 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= .cse2 (select |c_#length| v_arrayElimCell_190))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse49)))) (forall ((v_arrayElimCell_190 Int)) (let ((.cse51 (select |c_#length| v_arrayElimCell_190)) (.cse50 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_190) .cse4))) (or (not (<= 0 .cse50)) (not (<= .cse2 .cse51)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse50 4) (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse52 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse50 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse52 (select |c_#length| v_arrayElimCell_194))) (<= .cse52 .cse51)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse50) (= .cse50 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (or .cse45 .cse47 .cse48) (or .cse38 .cse12) (or (and (forall ((v_subst_1 Int)) (or (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (<= .cse53 (select |c_#length| v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse54 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse46 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse54 (select |c_#length| v_arrayElimCell_194))) (<= .cse54 .cse8)))))) (or .cse5 (forall ((v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (or (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (<= .cse53 (select |c_#length| v_subst_1))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse46 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse8)))) (or .cse20 (forall ((v_arrayElimCell_194 Int) (v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (or (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_subst_1 (store (select |c_#memory_$Pointer$.offset| v_subst_1) .cse46 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| v_arrayElimCell_194)) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (<= .cse53 (select |c_#length| v_subst_1)))))) .cse55) .cse45 .cse47)))))) (not (<= 0 .cse4)) (not (<= 0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) is different from true [2022-11-16 12:46:06,306 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 12 treesize of output 10 [2022-11-16 12:46:06,533 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 12 treesize of output 10 [2022-11-16 12:46:06,569 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 12 treesize of output 10 [2022-11-16 12:46:06,644 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 12 treesize of output 10 [2022-11-16 12:46:06,679 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 12 treesize of output 10 [2022-11-16 12:46:06,741 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 12 treesize of output 10 [2022-11-16 12:46:06,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-11-16 12:46:07,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-11-16 12:46:07,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-11-16 12:46:07,641 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 12 treesize of output 10 [2022-11-16 12:46:07,649 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 12 treesize of output 10 [2022-11-16 12:46:07,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-11-16 12:46:07,993 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 12 treesize of output 10 [2022-11-16 12:46:08,003 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 12 treesize of output 10 [2022-11-16 12:46:08,107 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 12 treesize of output 10 [2022-11-16 12:46:08,408 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 12 treesize of output 10 [2022-11-16 12:46:13,067 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse34 (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse199 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse197 (select (select .cse199 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse197)) (forall ((v_arrayElimCell_190 Int)) (let ((.cse198 (select (select .cse199 v_arrayElimCell_190) .cse197)) (.cse200 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (not (<= 0 .cse198)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store .cse199 v_subst_2 (store (select .cse199 v_subst_2) .cse198 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse198 4) (select .cse200 v_subst_2))))) (not (<= (+ .cse197 4) (select .cse200 v_arrayElimCell_190))))))))))))))) (.cse1 (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse194 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse196 (select (select .cse194 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_arrayElimCell_190 Int)) (let ((.cse193 (select (select .cse194 v_arrayElimCell_190) .cse196)) (.cse195 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (= .cse193 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse193)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store .cse194 v_subst_2 (store (select .cse194 v_subst_2) .cse193 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse193 4) (select .cse195 v_subst_2))))) (not (<= (+ .cse196 4) (select .cse195 v_arrayElimCell_190)))))) (not (<= 0 .cse196)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))))) (.cse35 (not (< |c_ULTIMATE.start_main_~#s~0#1.base| |c_#StackHeapBarrier|)))) (let ((.cse9 (and .cse1 (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_191 Int) (v_arrayElimCell_190 Int)) (let ((.cse183 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse182 (select (select .cse183 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse180 (select (select .cse183 v_arrayElimCell_190) .cse182)) (.cse181 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (= .cse180 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= (+ .cse180 4) (select .cse181 v_subst_1))) (not (<= 0 .cse182)) (not (<= 0 .cse180)) (not (<= (+ .cse182 4) (select .cse181 v_arrayElimCell_190))) (<= (+ (select (select (store (store .cse183 v_subst_1 (store (select .cse183 v_subst_1) .cse180 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select .cse181 v_arrayElimCell_191))))))) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse185 (select (select .cse188 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_arrayElimCell_190 Int)) (let ((.cse186 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571)) (.cse184 (select (select .cse188 v_arrayElimCell_190) .cse185))) (or (= .cse184 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse184)) (not (<= (+ .cse185 4) (select .cse186 v_arrayElimCell_190))) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse184 4) (select .cse186 v_subst_1))) (forall ((v_prenex_195 (Array Int Int)) (v_arrayElimCell_191 Int)) (let ((.cse187 (+ (select (select (store (store .cse188 v_subst_1 (store (select .cse188 v_subst_1) .cse184 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse187 (select .cse186 v_arrayElimCell_194))) (<= .cse187 (select .cse186 v_arrayElimCell_191)))))))))) (not (<= 0 .cse185)))))))))) (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse192 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572))) (let ((.cse190 (select (select .cse192 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse189 (select (select .cse192 v_arrayElimCell_190) .cse190)) (.cse191 (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571))) (or (not (<= 8 v_ArrVal_3571)) (= .cse189 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse190)) (not (<= (+ .cse190 4) (select .cse191 v_arrayElimCell_190))) (not (<= 0 .cse189)) (not (<= (+ .cse189 4) (select .cse191 v_subst_1))))))))))) (.cse0 (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse177 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse178 (select .cse177 |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse179 (select .cse178 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_arrayElimCell_190 Int)) (let ((.cse174 (select (select .cse177 v_arrayElimCell_190) .cse179)) (.cse175 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (not (<= (+ .cse174 4) (select .cse175 |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse176 (+ 4 (select (select (store (store .cse177 |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse178 .cse174 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (<= .cse176 v_ArrVal_3571) (forall ((v_arrayElimCell_194 Int)) (<= .cse176 (select .cse175 v_arrayElimCell_194)))))) (not (<= 0 .cse174)) (not (= .cse174 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= (+ .cse179 4) (select .cse175 v_arrayElimCell_190)))))) (not (<= 0 .cse179)))))))))))) (.cse42 (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_arrayElimCell_190 Int)) (let ((.cse169 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse170 (select .cse169 |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse173 (select .cse170 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse171 (select (select .cse169 v_arrayElimCell_190) .cse173)) (.cse172 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (<= (+ 4 (select (select (store (store .cse169 |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse170 .cse171 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_ArrVal_3571) (not (<= (+ .cse171 4) (select .cse172 |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (not (<= 0 .cse173)) (not (<= 0 .cse171)) (not (= .cse171 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= (+ .cse173 4) (select .cse172 v_arrayElimCell_190)))))))))))))) (.cse54 (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_arrayElimCell_190 Int)) (let ((.cse168 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572))) (let ((.cse167 (select (select .cse168 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse166 (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571)) (.cse165 (select (select .cse168 v_arrayElimCell_190) .cse167))) (or (not (<= 8 v_ArrVal_3571)) (not (<= (+ .cse165 4) (select .cse166 |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (not (<= 0 .cse167)) (not (<= (+ .cse167 4) (select .cse166 v_arrayElimCell_190))) (not (<= 0 .cse165)) (not (= .cse165 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))))))) (.cse22 (and (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse156 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse152 (select (select .cse156 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse152)) (forall ((v_arrayElimCell_190 Int)) (let ((.cse154 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571)) (.cse153 (select (select .cse156 v_arrayElimCell_190) .cse152))) (or (not (<= 0 .cse153)) (not (<= (+ .cse152 4) (select .cse154 v_arrayElimCell_190))) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse153 4) (select .cse154 v_subst_1))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_prenex_195 (Array Int Int)) (v_arrayElimCell_191 Int)) (let ((.cse155 (+ (select (select (store (store .cse156 v_subst_1 (store (select .cse156 v_subst_1) .cse153 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (forall ((v_arrayElimCell_194 Int)) (<= .cse155 (select .cse154 v_arrayElimCell_194))) (<= .cse155 (select .cse154 v_arrayElimCell_191)))))))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))))) .cse34 (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_191 Int) (v_arrayElimCell_190 Int)) (let ((.cse160 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse159 (select (select .cse160 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse157 (select (select .cse160 v_arrayElimCell_190) .cse159)) (.cse158 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (not (<= (+ .cse157 4) (select .cse158 v_subst_1))) (not (<= 0 .cse159)) (not (<= 0 .cse157)) (not (<= (+ .cse159 4) (select .cse158 v_arrayElimCell_190))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select (store (store .cse160 v_subst_1 (store (select .cse160 v_subst_1) .cse157 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select .cse158 v_arrayElimCell_191))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse164 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572))) (let ((.cse161 (select (select .cse164 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse163 (select (select .cse164 v_arrayElimCell_190) .cse161)) (.cse162 (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571))) (or (not (<= 8 v_ArrVal_3571)) (not (<= 0 .cse161)) (not (<= (+ .cse161 4) (select .cse162 v_arrayElimCell_190))) (not (<= 0 .cse163)) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (<= (+ .cse163 4) (select .cse162 v_subst_1))))))))))) (.cse43 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse55 (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse150 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse148 (select (select .cse150 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse148)) (forall ((v_arrayElimCell_190 Int)) (let ((.cse149 (select (select .cse150 v_arrayElimCell_190) .cse148)) (.cse151 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (not (<= 0 .cse149)) (not (= .cse149 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store .cse150 v_subst_2 (store (select .cse150 v_subst_2) .cse149 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse149 4) (select .cse151 v_subst_2))))) (not (<= (+ .cse148 4) (select .cse151 v_arrayElimCell_190)))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))))) (.cse103 (and (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse137 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse138 (select (select .cse137 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse135 (select (select .cse137 v_arrayElimCell_190) .cse138)) (.cse136 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (not (<= (+ .cse135 4) (select .cse136 v_subst_1))) (<= (+ (select (select (store (store .cse137 v_subst_1 (store (select .cse137 v_subst_1) .cse135 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) v_ArrVal_3571) (not (<= 0 .cse138)) (not (<= 0 .cse135)) (not (<= (+ .cse138 4) (select .cse136 v_arrayElimCell_190)))))))) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse34 (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse142 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572))) (let ((.cse139 (select (select .cse142 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse141 (select (select .cse142 v_arrayElimCell_190) .cse139)) (.cse140 (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571))) (or (not (<= 8 v_ArrVal_3571)) (not (<= 0 .cse139)) (not (<= (+ .cse139 4) (select .cse140 v_arrayElimCell_190))) (not (<= 0 .cse141)) (not (<= (+ .cse141 4) (select .cse140 v_subst_1))))))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse147 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse143 (select (select .cse147 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse143)) (forall ((v_arrayElimCell_190 Int)) (let ((.cse144 (select (select .cse147 v_arrayElimCell_190) .cse143)) (.cse145 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (forall ((v_subst_1 Int)) (or (not (<= (+ .cse144 4) (select .cse145 v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse146 (+ (select (select (store (store .cse147 v_subst_1 (store (select .cse147 v_subst_1) .cse144 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse146 v_ArrVal_3571) (forall ((v_arrayElimCell_194 Int)) (<= .cse146 (select .cse145 v_arrayElimCell_194)))))))) (not (<= 0 .cse144)) (not (<= (+ .cse143 4) (select .cse145 v_arrayElimCell_190)))))))))))))))) (.cse10 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and .cse0 .cse1 (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select v_ArrVal_3572 .cse3))) (or (not (<= 0 .cse2)) (not (<= 0 .cse3)) (<= (+ (select (select (store (store .cse4 v_subst_1 (store (select .cse4 v_subst_1) .cse2 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) v_ArrVal_3571) (not (<= (+ .cse2 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571) v_subst_1))) (not (<= (+ .cse3 4) v_ArrVal_3571)) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse5)) (forall ((v_arrayElimCell_190 Int)) (let ((.cse8 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571)) (.cse6 (select (select .cse7 v_arrayElimCell_190) .cse5))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store .cse7 v_subst_2 (store (select .cse7 v_subst_2) .cse6 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse6 4) (select .cse8 v_subst_2))))) (not (<= (+ .cse5 4) (select .cse8 v_arrayElimCell_190))) (= .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))))))))) (or .cse9 .cse10) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse11 (select v_ArrVal_3572 .cse12))) (or (not (<= 0 .cse11)) (not (<= 0 .cse12)) (not (<= (+ .cse12 4) v_ArrVal_3571)) (forall ((v_subst_1 Int)) (let ((.cse13 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (not (<= (+ .cse11 4) (select .cse13 v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse14 (+ (select (select (store (store .cse15 v_subst_1 (store (select .cse15 v_subst_1) .cse11 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse14 v_ArrVal_3571) (forall ((v_arrayElimCell_194 Int)) (<= .cse14 (select .cse13 v_arrayElimCell_194)))))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|))))))))))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse16 (select v_ArrVal_3572 .cse17))) (or (= .cse16 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse16)) (not (<= 0 .cse17)) (<= (+ (select (select (store (store .cse18 v_subst_1 (store (select .cse18 v_subst_1) .cse16 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) v_ArrVal_3571) (not (<= (+ .cse16 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571) v_subst_1))) (not (<= (+ .cse17 4) v_ArrVal_3571))))))) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_subst_1 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse19 (select v_ArrVal_3572 .cse20))) (or (not (<= 0 .cse19)) (not (<= 0 .cse20)) (<= (+ (select (select (store (store .cse21 v_subst_1 (store (select .cse21 v_subst_1) .cse19 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) v_ArrVal_3571) (not (<= (+ .cse19 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571) v_subst_1))) (not (<= (+ .cse20 4) v_ArrVal_3571))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (or .cse22 .cse10) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse26 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse24 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (let ((.cse27 (select .cse24 v_arrayElimCell_190)) (.cse23 (select (select .cse26 v_arrayElimCell_190) .cse25))) (or (not (<= (+ .cse23 4) (select .cse24 v_subst_1))) (not (<= 0 .cse25)) (not (<= 0 .cse23)) (<= (+ (select (select (store (store .cse26 v_subst_1 (store (select .cse26 v_subst_1) .cse23 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse27) (not (<= (+ .cse25 4) .cse27)) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse33 (select (select .cse32 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_arrayElimCell_190 Int)) (let ((.cse29 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (let ((.cse31 (select .cse29 v_arrayElimCell_190)) (.cse28 (select (select .cse32 v_arrayElimCell_190) .cse33))) (or (forall ((v_subst_1 Int)) (or (not (<= (+ .cse28 4) (select .cse29 v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse30 (+ (select (select (store (store .cse32 v_subst_1 (store (select .cse32 v_subst_1) .cse28 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse30 .cse31) (forall ((v_arrayElimCell_194 Int)) (<= .cse30 (select .cse29 v_arrayElimCell_194)))))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (not (<= 0 .cse28)) (not (<= (+ .cse33 4) .cse31)) (= .cse28 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (not (<= 0 .cse33)))))))))) .cse34 (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_subst_1 Int)) (let ((.cse37 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse36 (select v_ArrVal_3572 .cse37))) (or (not (<= 8 v_ArrVal_3571)) (not (<= 0 .cse36)) (not (<= 0 .cse37)) (not (<= (+ .cse37 4) v_ArrVal_3571)) (not (<= (+ .cse36 4) (select (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571) v_subst_1)))))))) (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_arrayElimCell_190 Int)) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse39 (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571)) (.cse38 (select (select .cse41 v_arrayElimCell_190) .cse40))) (or (not (<= 8 v_ArrVal_3571)) (not (<= (+ .cse38 4) (select .cse39 |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (= .cse38 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse40)) (not (<= (+ .cse40 4) (select .cse39 v_arrayElimCell_190))) (not (<= 0 .cse38)) (not (= .cse38 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))))) .cse42 (or .cse43 .cse9) (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse45 (select (select .cse47 v_arrayElimCell_190) .cse44)) (.cse46 (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571))) (or (not (<= 8 v_ArrVal_3571)) (not (<= 0 .cse44)) (= .cse45 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (<= (+ .cse44 4) (select .cse46 v_arrayElimCell_190))) (not (<= 0 .cse45)) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (<= (+ .cse45 4) (select .cse46 v_subst_1))))))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse48)) (forall ((v_arrayElimCell_190 Int)) (let ((.cse50 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (let ((.cse52 (select .cse50 v_arrayElimCell_190)) (.cse49 (select (select .cse53 v_arrayElimCell_190) .cse48))) (or (= .cse49 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse49)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse49 4) (select .cse50 v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse51 (+ (select (select (store (store .cse53 v_subst_1 (store (select .cse53 v_subst_1) .cse49 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse51 .cse52) (forall ((v_arrayElimCell_194 Int)) (<= .cse51 (select .cse50 v_arrayElimCell_194)))))))) (not (<= (+ .cse48 4) .cse52)) (= .cse49 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))))) .cse54 (or (and .cse0 .cse42 .cse54 .cse55) .cse10) (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_subst_1 Int)) (let ((.cse57 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse56 (select v_ArrVal_3572 .cse57))) (or (not (<= 8 v_ArrVal_3571)) (not (<= 0 .cse56)) (not (<= 0 .cse57)) (not (<= (+ .cse57 4) v_ArrVal_3571)) (not (<= (+ .cse56 4) (select (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571) v_subst_1))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse61 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse59 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571)) (.cse60 (select (select .cse61 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse58 (select (select .cse61 v_arrayElimCell_190) .cse60)) (.cse62 (select .cse59 v_arrayElimCell_190))) (or (= .cse58 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= (+ .cse58 4) (select .cse59 v_subst_1))) (not (<= 0 .cse60)) (not (<= 0 .cse58)) (<= (+ (select (select (store (store .cse61 v_subst_1 (store (select .cse61 v_subst_1) .cse58 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse62) (not (<= (+ .cse60 4) .cse62)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1)))))))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse65 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse63 (select (select .cse65 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse63)) (forall ((v_arrayElimCell_190 Int)) (let ((.cse66 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571)) (.cse64 (select (select .cse65 v_arrayElimCell_190) .cse63))) (or (= .cse64 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse64)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store .cse65 v_subst_2 (store (select .cse65 v_subst_2) .cse64 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse64 4) (select .cse66 v_subst_2))))) (not (<= (+ .cse63 4) (select .cse66 v_arrayElimCell_190))) (= .cse64 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse67 (select (select .cse72 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse67)) (forall ((v_arrayElimCell_190 Int)) (let ((.cse69 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (let ((.cse68 (select (select .cse72 v_arrayElimCell_190) .cse67)) (.cse71 (select .cse69 v_arrayElimCell_190))) (or (not (<= 0 .cse68)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse68 4) (select .cse69 v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse70 (+ (select (select (store (store .cse72 v_subst_1 (store (select .cse72 v_subst_1) .cse68 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse70 .cse71) (forall ((v_arrayElimCell_194 Int)) (<= .cse70 (select .cse69 v_arrayElimCell_194)))))) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1))) (not (<= (+ .cse67 4) .cse71)))))))))))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse77 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse78 (select .cse77 |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse73 (select .cse78 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse73)) (forall ((v_arrayElimCell_190 Int)) (let ((.cse74 (select (select .cse77 v_arrayElimCell_190) .cse73)) (.cse75 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (= .cse74 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= (+ .cse74 4) (select .cse75 |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse76 (+ 4 (select (select (store (store .cse77 |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse78 .cse74 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (<= .cse76 v_ArrVal_3571) (forall ((v_arrayElimCell_194 Int)) (<= .cse76 (select .cse75 v_arrayElimCell_194)))))) (not (<= 0 .cse74)) (not (= .cse74 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= (+ .cse73 4) (select .cse75 v_arrayElimCell_190))))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse82 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse83 (select (select .cse82 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse79 (select v_ArrVal_3572 .cse83))) (or (not (<= 0 .cse79)) (forall ((v_subst_1 Int)) (let ((.cse80 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (not (<= (+ .cse79 4) (select .cse80 v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse81 (+ (select (select (store (store .cse82 v_subst_1 (store (select .cse82 v_subst_1) .cse79 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse81 v_ArrVal_3571) (forall ((v_arrayElimCell_194 Int)) (<= .cse81 (select .cse80 v_arrayElimCell_194))))))))) (not (<= 0 .cse83)) (not (<= (+ .cse83 4) v_ArrVal_3571))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse88 (select (select .cse87 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse84 (select v_ArrVal_3572 .cse88))) (or (= .cse84 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse84)) (forall ((v_subst_1 Int)) (let ((.cse85 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (not (<= (+ .cse84 4) (select .cse85 v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse86 (+ (select (select (store (store .cse87 v_subst_1 (store (select .cse87 v_subst_1) .cse84 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse86 v_ArrVal_3571) (forall ((v_arrayElimCell_194 Int)) (<= .cse86 (select .cse85 v_arrayElimCell_194))))))))) (not (<= 0 .cse88)) (not (<= (+ .cse88 4) v_ArrVal_3571))))))))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse91 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse89 (select (select .cse91 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse89)) (forall ((v_arrayElimCell_190 Int)) (let ((.cse90 (select (select .cse91 v_arrayElimCell_190) .cse89)) (.cse92 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (= .cse90 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse90)) (not (= .cse90 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store .cse91 v_subst_2 (store (select .cse91 v_subst_2) .cse90 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse90 4) (select .cse92 v_subst_2))))) (not (<= (+ .cse89 4) (select .cse92 v_arrayElimCell_190)))))))))))))) (or .cse43 .cse22) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse96 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse95 (select (select .cse96 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse94 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (let ((.cse97 (select .cse94 v_arrayElimCell_190)) (.cse93 (select (select .cse96 v_arrayElimCell_190) .cse95))) (or (= .cse93 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= (+ .cse93 4) (select .cse94 v_subst_1))) (not (<= 0 .cse95)) (not (<= 0 .cse93)) (<= (+ (select (select (store (store .cse96 v_subst_1 (store (select .cse96 v_subst_1) .cse93 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse97) (not (<= (+ .cse95 4) .cse97)) (= .cse93 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse100 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse99 (select (select .cse100 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse98 (select v_ArrVal_3572 .cse99))) (or (not (<= 0 .cse98)) (not (<= 0 .cse99)) (not (<= (+ .cse99 4) v_ArrVal_3571)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store .cse100 v_subst_2 (store (select .cse100 v_subst_2) .cse98 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse98 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571) v_subst_2)))))))))))))) (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_subst_1 Int)) (let ((.cse102 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse101 (select v_ArrVal_3572 .cse102))) (or (not (<= 8 v_ArrVal_3571)) (not (<= 0 .cse101)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse101) (not (<= 0 .cse102)) (not (<= (+ .cse102 4) v_ArrVal_3571)) (not (<= (+ .cse101 4) (select (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571) v_subst_1)))))))) (or .cse43 .cse103) .cse55 (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse105 (select (select .cse109 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_arrayElimCell_190 Int)) (let ((.cse107 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (let ((.cse106 (select .cse107 v_arrayElimCell_190)) (.cse104 (select (select .cse109 v_arrayElimCell_190) .cse105))) (or (= .cse104 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse104)) (not (<= (+ .cse105 4) .cse106)) (forall ((v_subst_1 Int)) (or (not (<= (+ .cse104 4) (select .cse107 v_subst_1))) (forall ((v_prenex_195 (Array Int Int))) (let ((.cse108 (+ (select (select (store (store .cse109 v_subst_1 (store (select .cse109 v_subst_1) .cse104 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (<= .cse108 .cse106) (forall ((v_arrayElimCell_194 Int)) (<= .cse108 (select .cse107 v_arrayElimCell_194)))))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1))))))) (not (<= 0 .cse105)))))))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse113 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse111 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571)) (.cse112 (select (select .cse113 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse110 (select (select .cse113 v_arrayElimCell_190) .cse112)) (.cse114 (select .cse111 v_arrayElimCell_190))) (or (not (<= (+ .cse110 4) (select .cse111 v_subst_1))) (not (<= 0 .cse112)) (not (<= 0 .cse110)) (<= (+ (select (select (store (store .cse113 v_subst_1 (store (select .cse113 v_subst_1) .cse110 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) .cse114) (not (<= (+ .cse112 4) .cse114)) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1)))))) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_arrayElimCell_190 Int)) (let ((.cse116 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse117 (select .cse116 |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse119 (select .cse117 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse115 (select (select .cse116 v_arrayElimCell_190) .cse119)) (.cse118 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571))) (or (= .cse115 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ 4 (select (select (store (store .cse116 |c_ULTIMATE.start_sll_circular_append_~head#1.base| (store .cse117 .cse115 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_prenex_195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_ArrVal_3571) (not (<= (+ .cse115 4) (select .cse118 |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (not (<= 0 .cse119)) (not (<= 0 .cse115)) (not (= .cse115 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (<= (+ .cse119 4) (select .cse118 v_arrayElimCell_190))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (forall ((v_ArrVal_3571 Int)) (or (not (<= 8 v_ArrVal_3571)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3572 (Array Int Int))) (let ((.cse122 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3572))) (let ((.cse121 (select (select .cse122 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse120 (select v_ArrVal_3572 .cse121))) (or (= .cse120 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse120)) (not (<= 0 .cse121)) (not (<= (+ .cse121 4) v_ArrVal_3571)) (forall ((v_ArrVal_3564 (Array Int Int)) (v_subst_2 Int)) (or (<= 0 (select (select (store (store .cse122 v_subst_2 (store (select .cse122 v_subst_2) .cse120 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3564) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (<= (+ .cse120 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_3571) v_subst_2)))))))))))))) (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse126 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572))) (let ((.cse123 (select (select .cse126 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse125 (select (select .cse126 v_arrayElimCell_190) .cse123)) (.cse124 (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571))) (or (not (<= 8 v_ArrVal_3571)) (not (<= 0 .cse123)) (not (<= (+ .cse123 4) (select .cse124 v_arrayElimCell_190))) (not (<= 0 .cse125)) (= v_subst_1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (<= (+ .cse125 4) (select .cse124 v_subst_1))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1))))))) (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse130 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572))) (let ((.cse128 (select (select .cse130 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse127 (select (select .cse130 v_arrayElimCell_190) .cse128)) (.cse129 (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571))) (or (not (<= 8 v_ArrVal_3571)) (= .cse127 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse128)) (= .cse127 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (<= (+ .cse128 4) (select .cse129 v_arrayElimCell_190))) (not (<= 0 .cse127)) (not (<= (+ .cse127 4) (select .cse129 v_subst_1))))))))) (or .cse35 (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3571 Int) (v_subst_1 Int) (v_arrayElimCell_190 Int)) (let ((.cse134 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3572))) (let ((.cse132 (select (select .cse134 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse131 (select (select .cse134 v_arrayElimCell_190) .cse132)) (.cse133 (store |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_3571))) (or (not (<= 8 v_ArrVal_3571)) (= .cse131 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (<= 0 .cse132)) (not (<= (+ .cse132 4) (select .cse133 v_arrayElimCell_190))) (not (<= 0 .cse131)) (not (<= (+ .cse131 4) (select .cse133 v_subst_1))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| v_subst_1))))))) (or .cse103 .cse10)))) is different from true [2022-11-16 12:46:13,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309132434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:13,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:46:13,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 60 [2022-11-16 12:46:13,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586076452] [2022-11-16 12:46:13,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:13,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-16 12:46:13,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-16 12:46:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4696, Unknown=10, NotChecked=564, Total=5550 [2022-11-16 12:46:13,099 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 61 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 53 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:46:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:20,231 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-11-16 12:46:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 12:46:20,232 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 53 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 58 [2022-11-16 12:46:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:20,234 INFO L225 Difference]: With dead ends: 101 [2022-11-16 12:46:20,234 INFO L226 Difference]: Without dead ends: 101 [2022-11-16 12:46:20,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=594, Invalid=8719, Unknown=15, NotChecked=772, Total=10100 [2022-11-16 12:46:20,237 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 65 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:20,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1993 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1585 Invalid, 0 Unknown, 382 Unchecked, 1.9s Time] [2022-11-16 12:46:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-16 12:46:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-16 12:46:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:46:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-11-16 12:46:20,248 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 58 [2022-11-16 12:46:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:20,249 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-11-16 12:46:20,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 53 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:46:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-11-16 12:46:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 12:46:20,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:20,250 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:20,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:20,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 12:46:20,459 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:46:20,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1788550569, now seen corresponding path program 1 times [2022-11-16 12:46:20,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:20,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047975611] [2022-11-16 12:46:20,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:20,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:46:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:46:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:46:23,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:23,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047975611] [2022-11-16 12:46:23,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047975611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:23,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725979248] [2022-11-16 12:46:23,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:23,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:23,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:23,479 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:23,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 12:46:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:23,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-16 12:46:23,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:23,852 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-16 12:46:23,952 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-16 12:46:24,014 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3752 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3752))))) is different from true [2022-11-16 12:46:24,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:24,070 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:46:24,099 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-16 12:46:24,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:24,409 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:46:25,172 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 26 treesize of output 14 [2022-11-16 12:46:25,178 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 7 treesize of output 3 [2022-11-16 12:46:25,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:25,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:46:25,191 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-16 12:46:25,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:25,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 14 treesize of output 16 [2022-11-16 12:46:25,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:25,838 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 34 treesize of output 32 [2022-11-16 12:46:25,855 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:46:25,855 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 15 treesize of output 15 [2022-11-16 12:46:25,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:25,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:25,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-16 12:46:27,600 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-16 12:46:27,600 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 73 [2022-11-16 12:46:27,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:27,667 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-16 12:46:27,668 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2022-11-16 12:46:28,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:28,720 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-16 12:46:28,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 230 treesize of output 231 [2022-11-16 12:46:28,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:28,825 INFO L321 Elim1Store]: treesize reduction 78, result has 41.8 percent of original size [2022-11-16 12:46:28,825 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 9 case distinctions, treesize of input 222 treesize of output 237 [2022-11-16 12:46:29,705 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-16 12:46:31,850 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 17 treesize of output 7 [2022-11-16 12:46:31,943 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 17 treesize of output 7 [2022-11-16 12:46:31,971 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 17 treesize of output 7 [2022-11-16 12:46:33,895 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 17 treesize of output 7 [2022-11-16 12:46:33,972 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 17 treesize of output 7 [2022-11-16 12:46:34,018 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 17 treesize of output 7 [2022-11-16 12:47:19,136 WARN L233 SmtUtils]: Spent 27.27s on a formula simplification. DAG size of input: 224 DAG size of output: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:47:19,735 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-16 12:47:19,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 375 treesize of output 253 [2022-11-16 12:47:41,476 WARN L233 SmtUtils]: Spent 18.42s on a formula simplification. DAG size of input: 121 DAG size of output: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:47:43,965 INFO L321 Elim1Store]: treesize reduction 72, result has 69.6 percent of original size [2022-11-16 12:47:43,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 234 treesize of output 340 [2022-11-16 12:48:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-16 12:48:52,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:49:10,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| Int) (v_ArrVal_3774 (Array Int Int)) (v_ArrVal_3763 (Array Int Int)) (v_ArrVal_3775 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3773 Int) (v_ArrVal_3764 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_32| Int) (v_ArrVal_3760 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_3774)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_3775))) (let ((.cse0 (select (select .cse4 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (select (select (store (store .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_32| (store (select .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_32|) .cse0 v_ArrVal_3760)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_3764) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_3773))) (or (not (<= 0 .cse0)) (<= (+ .cse1 8) (select .cse2 (select (select (store (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_32| (store (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_32|) .cse0 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_3763) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< .cse1 0) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| |c_#StackHeapBarrier|)) (< v_ArrVal_3773 (+ v_ArrVal_3760 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33|) 0)) (not (<= (+ .cse0 4) (select .cse2 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_32|)))))))) is different from false [2022-11-16 12:49:10,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725979248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:49:10,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:49:10,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 33] total 60 [2022-11-16 12:49:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735239704] [2022-11-16 12:49:10,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:49:10,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-16 12:49:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:49:10,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-16 12:49:10,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=5144, Unknown=24, NotChecked=294, Total=5852 [2022-11-16 12:49:10,930 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 61 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:49:31,301 WARN L233 SmtUtils]: Spent 13.52s on a formula simplification. DAG size of input: 106 DAG size of output: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:49:42,640 WARN L233 SmtUtils]: Spent 11.16s on a formula simplification. DAG size of input: 106 DAG size of output: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:49:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:49:43,625 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-11-16 12:49:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 12:49:43,626 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2022-11-16 12:49:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:49:43,626 INFO L225 Difference]: With dead ends: 105 [2022-11-16 12:49:43,626 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 12:49:43,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2750 ImplicationChecksByTransitivity, 118.3s TimeCoverageRelationStatistics Valid=682, Invalid=8807, Unknown=25, NotChecked=386, Total=9900 [2022-11-16 12:49:43,628 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 77 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 516 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:49:43,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1386 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 631 Invalid, 0 Unknown, 516 Unchecked, 1.2s Time] [2022-11-16 12:49:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 12:49:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-11-16 12:49:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.325) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:49:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2022-11-16 12:49:43,632 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 61 [2022-11-16 12:49:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:49:43,632 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2022-11-16 12:49:43,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:49:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2022-11-16 12:49:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:49:43,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:49:43,634 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:49:43,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-16 12:49:43,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 12:49:43,840 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:49:43,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:49:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash -810176418, now seen corresponding path program 1 times [2022-11-16 12:49:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:49:43,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56974194] [2022-11-16 12:49:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:49:43,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:49:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:49:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:49:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:49:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:49:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:49:47,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:49:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:49:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:49:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:49:47,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56974194] [2022-11-16 12:49:47,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56974194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:49:47,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664727696] [2022-11-16 12:49:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:49:47,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:49:47,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:49:47,857 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:49:47,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 12:49:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:49:48,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 146 conjunts are in the unsatisfiable core [2022-11-16 12:49:48,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:49:48,238 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-16 12:49:48,358 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-16 12:49:48,456 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-16 12:49:48,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:48,772 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:49:49,118 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-16 12:49:49,126 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-16 12:49:49,613 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:49:49,614 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-16 12:49:49,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:49,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-16 12:49:50,047 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-16 12:49:50,526 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:49:50,527 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-16 12:49:51,170 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:49:51,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 19 [2022-11-16 12:49:51,176 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-16 12:49:51,182 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 7 treesize of output 3 [2022-11-16 12:49:51,188 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-16 12:49:52,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:52,147 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:49:52,148 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 54 treesize of output 50 [2022-11-16 12:49:52,180 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:49:52,180 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 15 treesize of output 15 [2022-11-16 12:49:52,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:52,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-16 12:49:52,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:52,227 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 14 treesize of output 16 [2022-11-16 12:49:54,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:54,341 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 13 treesize of output 9 [2022-11-16 12:49:54,775 INFO L321 Elim1Store]: treesize reduction 111, result has 14.0 percent of original size [2022-11-16 12:49:54,776 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 77 [2022-11-16 12:49:54,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:54,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:54,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 59 [2022-11-16 12:49:55,174 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-16 12:49:55,174 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 175 treesize of output 138 [2022-11-16 12:49:55,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:55,218 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-16 12:49:55,218 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 123 treesize of output 97 [2022-11-16 12:49:55,235 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 67 treesize of output 25 [2022-11-16 12:49:55,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:55,775 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-11-16 12:49:56,418 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:49:56,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-11-16 12:49:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:49:56,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:01,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3979 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| Int) (v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 (Array Int Int)) (v_ArrVal_3970 (Array Int Int)) (v_ArrVal_3968 (Array Int Int)) (v_ArrVal_3969 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3980)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3981))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select .cse4 .cse6) .cse7)) (.cse5 (select (select .cse2 .cse6) .cse7))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (let ((.cse0 (store (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3969))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store .cse2 .cse3 v_ArrVal_3968) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3970) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|) 0)) (not (<= (+ .cse5 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3979) .cse3))) (not (<= 0 .cse5))))))) is different from false [2022-11-16 12:50:01,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664727696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:01,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:50:01,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 69 [2022-11-16 12:50:01,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757328759] [2022-11-16 12:50:01,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:01,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-16 12:50:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:01,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-16 12:50:01,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=5471, Unknown=102, NotChecked=150, Total=6006 [2022-11-16 12:50:01,175 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 69 states, 65 states have (on average 1.676923076923077) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:50:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:09,271 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-11-16 12:50:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 12:50:09,271 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 65 states have (on average 1.676923076923077) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-11-16 12:50:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:09,272 INFO L225 Difference]: With dead ends: 105 [2022-11-16 12:50:09,272 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 12:50:09,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2092 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=593, Invalid=9201, Unknown=110, NotChecked=196, Total=10100 [2022-11-16 12:50:09,274 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 469 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:09,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1637 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1908 Invalid, 0 Unknown, 112 Unchecked, 2.9s Time] [2022-11-16 12:50:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 12:50:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2022-11-16 12:50:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 97 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:50:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-16 12:50:09,278 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 63 [2022-11-16 12:50:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:09,278 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-16 12:50:09,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 65 states have (on average 1.676923076923077) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:50:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-16 12:50:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:50:09,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:09,279 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:09,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:09,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:09,486 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-11-16 12:50:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:09,487 INFO L85 PathProgramCache]: Analyzing trace with hash -810125923, now seen corresponding path program 1 times [2022-11-16 12:50:09,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:09,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775966732] [2022-11-16 12:50:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:09,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:50:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:12,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:50:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:50:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:12,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775966732] [2022-11-16 12:50:12,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775966732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:12,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943041128] [2022-11-16 12:50:12,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:12,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:12,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:12,835 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:12,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96653f72-3c35-4834-8d8a-cc00af8e45db/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 12:50:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:13,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-16 12:50:13,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:13,218 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-16 12:50:13,325 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-16 12:50:13,415 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_4161 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_4161) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:50:13,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:50:13,462 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:50:13,495 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-16 12:50:13,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:50:13,790 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:50:14,670 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 9 treesize of output 5 [2022-11-16 12:50:14,677 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-16 12:50:14,683 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 7 treesize of output 3 [2022-11-16 12:50:15,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:50:15,566 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 16 treesize of output 18 [2022-11-16 12:50:15,584 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:50:15,585 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 15 treesize of output 15 [2022-11-16 12:50:15,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:50:15,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-16 12:50:15,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:50:15,614 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 14 treesize of output 16 [2022-11-16 12:50:17,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:50:17,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-11-16 12:50:18,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:50:18,438 INFO L321 Elim1Store]: treesize reduction 64, result has 26.4 percent of original size [2022-11-16 12:50:18,438 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 208 treesize of output 123 [2022-11-16 12:50:18,485 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-16 12:50:18,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 101 [2022-11-16 12:50:19,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:50:19,463 INFO L321 Elim1Store]: treesize reduction 78, result has 41.8 percent of original size [2022-11-16 12:50:19,464 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 9 case distinctions, treesize of input 208 treesize of output 216 [2022-11-16 12:50:19,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:50:19,740 INFO L321 Elim1Store]: treesize reduction 170, result has 50.7 percent of original size [2022-11-16 12:50:19,740 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 8 new quantified variables, introduced 14 case distinctions, treesize of input 266 treesize of output 304 [2022-11-16 12:50:21,584 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 120 treesize of output 90 [2022-11-16 12:50:21,600 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 12:50:22,935 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 17 treesize of output 3 [2022-11-16 12:50:22,982 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 17 treesize of output 3 [2022-11-16 12:50:23,433 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 17 treesize of output 3 [2022-11-16 12:50:23,514 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 17 treesize of output 3 [2022-11-16 12:50:26,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:50:26,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 582 treesize of output 830 [2022-11-16 12:50:32,089 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 59 treesize of output 43 [2022-11-16 12:53:48,633 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 59 treesize of output 43 [2022-11-16 12:53:50,038 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 59 treesize of output 43 [2022-11-16 12:53:50,879 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 59 treesize of output 43 [2022-11-16 12:53:52,712 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 59 treesize of output 43 [2022-11-16 12:53:54,560 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 59 treesize of output 43 [2022-11-16 12:54:47,000 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 59 treesize of output 43 [2022-11-16 12:54:50,642 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 17 treesize of output 9 [2022-11-16 12:55:07,235 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 17 treesize of output 9 [2022-11-16 12:55:10,871 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 17 treesize of output 9 [2022-11-16 12:55:12,855 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 17 treesize of output 9 [2022-11-16 12:55:15,726 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 17 treesize of output 9 [2022-11-16 12:55:15,975 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 17 treesize of output 9