./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a --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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- 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-b5237d8 [2022-11-21 17:18:02,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:18:02,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:18:02,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:18:02,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:18:02,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:18:02,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:18:02,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:18:02,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:18:02,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:18:02,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:18:02,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:18:02,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:18:02,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:18:02,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:18:02,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:18:02,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:18:02,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:18:02,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:18:02,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:18:02,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:18:02,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:18:02,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:18:02,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:18:02,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:18:02,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:18:02,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:18:02,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:18:02,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:18:02,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:18:02,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:18:02,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:18:02,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:18:02,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:18:02,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:18:02,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:18:02,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:18:02,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:18:02,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:18:02,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:18:02,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:18:02,998 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 17:18:03,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:18:03,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:18:03,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:18:03,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:18:03,041 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:18:03,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:18:03,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:18:03,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:18:03,043 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:18:03,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:18:03,044 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:18:03,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:18:03,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:18:03,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:18:03,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:18:03,045 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 17:18:03,045 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 17:18:03,046 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 17:18:03,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:18:03,046 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 17:18:03,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:18:03,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:18:03,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:18:03,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:18:03,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:18:03,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:18:03,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:18:03,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:18:03,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:18:03,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:18:03,049 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_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/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_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-11-21 17:18:03,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:18:03,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:18:03,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:18:03,438 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:18:03,447 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:18:03,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-21 17:18:06,561 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:18:06,822 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:18:06,823 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-21 17:18:06,836 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/data/9106b913d/3c3f763c8f574ee0bd8f9610a3ea0c27/FLAGfa338d2e8 [2022-11-21 17:18:06,858 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/data/9106b913d/3c3f763c8f574ee0bd8f9610a3ea0c27 [2022-11-21 17:18:06,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:18:06,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:18:06,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:18:06,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:18:06,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:18:06,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:18:06" (1/1) ... [2022-11-21 17:18:06,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad47576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:06, skipping insertion in model container [2022-11-21 17:18:06,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:18:06" (1/1) ... [2022-11-21 17:18:06,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:18:06,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:18:07,291 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-21 17:18:07,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:18:07,340 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:18:07,427 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-21 17:18:07,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:18:07,461 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:18:07,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07 WrapperNode [2022-11-21 17:18:07,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:18:07,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:18:07,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:18:07,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:18:07,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,527 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2022-11-21 17:18:07,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:18:07,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:18:07,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:18:07,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:18:07,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,565 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:18:07,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:18:07,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:18:07,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:18:07,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (1/1) ... [2022-11-21 17:18:07,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:18:07,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:07,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:18:07,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:18:07,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:18:07,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:18:07,644 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-21 17:18:07,644 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-21 17:18:07,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 17:18:07,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:18:07,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:18:07,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 17:18:07,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 17:18:07,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:18:07,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 17:18:07,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:18:07,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:18:07,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:18:07,915 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:18:07,917 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:18:08,301 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:18:08,309 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:18:08,309 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 17:18:08,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:18:08 BoogieIcfgContainer [2022-11-21 17:18:08,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:18:08,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:18:08,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:18:08,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:18:08,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:18:06" (1/3) ... [2022-11-21 17:18:08,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7f5e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:18:08, skipping insertion in model container [2022-11-21 17:18:08,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:18:07" (2/3) ... [2022-11-21 17:18:08,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7f5e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:18:08, skipping insertion in model container [2022-11-21 17:18:08,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:18:08" (3/3) ... [2022-11-21 17:18:08,322 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-21 17:18:08,343 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:18:08,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-11-21 17:18:08,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:18:08,403 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;@72c9c5b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:18:08,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-21 17:18:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 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-21 17:18:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 17:18:08,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:08,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 17:18:08,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:08,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2022-11-21 17:18:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:08,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867255904] [2022-11-21 17:18:08,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:08,691 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-21 17:18:08,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:08,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867255904] [2022-11-21 17:18:08,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867255904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:18:08,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:18:08,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:18:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148174887] [2022-11-21 17:18:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:18:08,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:18:08,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:08,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:18:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:18:08,731 INFO L87 Difference]: Start difference. First operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 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-21 17:18:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:08,908 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-21 17:18:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:18:08,913 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-21 17:18:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:08,922 INFO L225 Difference]: With dead ends: 114 [2022-11-21 17:18:08,922 INFO L226 Difference]: Without dead ends: 111 [2022-11-21 17:18:08,924 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-21 17:18:08,927 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:08,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:18:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-21 17:18:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-21 17:18:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 106 states have internal predecessors, (113), 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-21 17:18:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-11-21 17:18:08,971 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2022-11-21 17:18:08,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:08,972 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-11-21 17:18:08,972 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-21 17:18:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-11-21 17:18:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 17:18:08,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:08,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 17:18:08,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:18:08,974 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2022-11-21 17:18:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:08,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992813856] [2022-11-21 17:18:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:09,108 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-21 17:18:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:09,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992813856] [2022-11-21 17:18:09,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992813856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:18:09,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:18:09,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:18:09,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423751754] [2022-11-21 17:18:09,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:18:09,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:18:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:09,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:18:09,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:18:09,112 INFO L87 Difference]: Start difference. First operand 111 states and 119 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-21 17:18:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:09,206 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-11-21 17:18:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:18:09,207 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-21 17:18:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:09,209 INFO L225 Difference]: With dead ends: 109 [2022-11-21 17:18:09,209 INFO L226 Difference]: Without dead ends: 109 [2022-11-21 17:18:09,209 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-21 17:18:09,211 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:09,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:18:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-21 17:18:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-21 17:18:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.88135593220339) internal successors, (111), 104 states have internal predecessors, (111), 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-21 17:18:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-11-21 17:18:09,221 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2022-11-21 17:18:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:09,222 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-11-21 17:18:09,222 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-21 17:18:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-11-21 17:18:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 17:18:09,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:09,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:18:09,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:18:09,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:09,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2022-11-21 17:18:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:09,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144233789] [2022-11-21 17:18:09,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:09,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:09,410 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-21 17:18:09,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:09,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144233789] [2022-11-21 17:18:09,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144233789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:18:09,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:18:09,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:18:09,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60575944] [2022-11-21 17:18:09,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:18:09,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:18:09,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:09,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:18:09,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:18:09,414 INFO L87 Difference]: Start difference. First operand 109 states and 117 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-21 17:18:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:09,545 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-21 17:18:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:18:09,546 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-21 17:18:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:09,547 INFO L225 Difference]: With dead ends: 116 [2022-11-21 17:18:09,547 INFO L226 Difference]: Without dead ends: 116 [2022-11-21 17:18:09,548 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-21 17:18:09,549 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:09,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:18:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-21 17:18:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2022-11-21 17:18:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 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-21 17:18:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2022-11-21 17:18:09,584 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2022-11-21 17:18:09,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:09,584 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2022-11-21 17:18:09,585 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-21 17:18:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2022-11-21 17:18:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:18:09,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:09,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:18:09,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:18:09,599 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2022-11-21 17:18:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:09,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958433227] [2022-11-21 17:18:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:09,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:09,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:09,919 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-21 17:18:09,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:09,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958433227] [2022-11-21 17:18:09,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958433227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:18:09,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:18:09,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:18:09,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715133381] [2022-11-21 17:18:09,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:18:09,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:18:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:09,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:18:09,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:18:09,923 INFO L87 Difference]: Start difference. First operand 110 states and 118 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-21 17:18:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:10,211 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-11-21 17:18:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:18:10,211 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-21 17:18:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:10,214 INFO L225 Difference]: With dead ends: 110 [2022-11-21 17:18:10,214 INFO L226 Difference]: Without dead ends: 110 [2022-11-21 17:18:10,215 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-21 17:18:10,216 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:10,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 380 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:18:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-21 17:18:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-11-21 17:18:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 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-21 17:18:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-11-21 17:18:10,225 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2022-11-21 17:18:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:10,226 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-11-21 17:18:10,226 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-21 17:18:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-11-21 17:18:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:18:10,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:10,227 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:18:10,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:18:10,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2022-11-21 17:18:10,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:10,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409748883] [2022-11-21 17:18:10,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:10,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:10,729 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-21 17:18:10,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:10,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409748883] [2022-11-21 17:18:10,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409748883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:18:10,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:18:10,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:18:10,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764593727] [2022-11-21 17:18:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:18:10,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:18:10,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:10,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:18:10,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:18:10,736 INFO L87 Difference]: Start difference. First operand 109 states and 117 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-21 17:18:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:11,046 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-11-21 17:18:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:18:11,049 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-21 17:18:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:11,049 INFO L225 Difference]: With dead ends: 109 [2022-11-21 17:18:11,050 INFO L226 Difference]: Without dead ends: 109 [2022-11-21 17:18:11,050 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-21 17:18:11,051 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:11,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:18:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-21 17:18:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2022-11-21 17:18:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 103 states have internal predecessors, (110), 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-21 17:18:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-11-21 17:18:11,065 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2022-11-21 17:18:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:11,066 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-11-21 17:18:11,070 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-21 17:18:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-11-21 17:18:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 17:18:11,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:11,071 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-21 17:18:11,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:18:11,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2022-11-21 17:18:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:11,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165324380] [2022-11-21 17:18:11,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:11,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:11,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:11,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:11,420 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-21 17:18:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:11,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165324380] [2022-11-21 17:18:11,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165324380] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:11,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844042536] [2022-11-21 17:18:11,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:11,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:11,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:11,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:11,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:18:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:11,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 17:18:11,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:11,663 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-21 17:18:11,729 WARN L859 $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-21 17:18:11,766 WARN L859 $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-21 17:18:11,792 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:18:11,793 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-21 17:18:11,879 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-21 17:18:11,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:18:12,246 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-21 17:18:12,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844042536] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:18:12,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:18:12,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-11-21 17:18:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416468463] [2022-11-21 17:18:12,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:18:12,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 17:18:12,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:12,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 17:18:12,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2022-11-21 17:18:12,253 INFO L87 Difference]: Start difference. First operand 108 states and 116 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-21 17:18:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:12,645 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-11-21 17:18:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:18:12,645 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-21 17:18:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:12,646 INFO L225 Difference]: With dead ends: 125 [2022-11-21 17:18:12,646 INFO L226 Difference]: Without dead ends: 125 [2022-11-21 17:18:12,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2022-11-21 17:18:12,648 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 115 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:12,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 406 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 394 Invalid, 0 Unknown, 260 Unchecked, 0.3s Time] [2022-11-21 17:18:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-21 17:18:12,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-11-21 17:18:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 102 states have internal predecessors, (109), 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-21 17:18:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-11-21 17:18:12,655 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 25 [2022-11-21 17:18:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:12,655 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-11-21 17:18:12,655 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-21 17:18:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-11-21 17:18:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 17:18:12,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:12,656 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-21 17:18:12,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:18:12,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:12,865 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2022-11-21 17:18:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:12,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043836824] [2022-11-21 17:18:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:12,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:13,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:18:13,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:13,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043836824] [2022-11-21 17:18:13,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043836824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:13,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151461576] [2022-11-21 17:18:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:13,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:13,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:13,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:13,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:18:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:13,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 17:18:13,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:13,578 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-21 17:18:13,876 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:18:13,877 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-21 17:18:13,886 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 16 treesize of output 11 [2022-11-21 17:18:13,955 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-21 17:18:13,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:18:14,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151461576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:14,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:18:14,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-11-21 17:18:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872435205] [2022-11-21 17:18:14,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:18:14,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-21 17:18:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:14,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 17:18:14,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-11-21 17:18:14,145 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 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-21 17:18:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:14,759 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-11-21 17:18:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:18:14,759 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 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-21 17:18:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:14,760 INFO L225 Difference]: With dead ends: 108 [2022-11-21 17:18:14,760 INFO L226 Difference]: Without dead ends: 108 [2022-11-21 17:18:14,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-11-21 17:18:14,762 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 206 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:14,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 453 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:18:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-21 17:18:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-11-21 17:18:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.8) internal successors, (108), 101 states have internal predecessors, (108), 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-21 17:18:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-11-21 17:18:14,767 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 25 [2022-11-21 17:18:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:14,768 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-11-21 17:18:14,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 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-21 17:18:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-11-21 17:18:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 17:18:14,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:14,769 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-21 17:18:14,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:18:14,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:14,970 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:14,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:14,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2022-11-21 17:18:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:14,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153863451] [2022-11-21 17:18:14,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:15,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:15,597 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-21 17:18:15,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:15,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153863451] [2022-11-21 17:18:15,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153863451] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:15,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579182418] [2022-11-21 17:18:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:15,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:15,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:15,600 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:15,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:18:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:15,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-21 17:18:15,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:15,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 17:18:15,804 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-21 17:18:15,828 WARN L859 $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-21 17:18:15,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:15,899 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-21 17:18:15,915 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_522))) is different from true [2022-11-21 17:18:15,934 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_522))) is different from true [2022-11-21 17:18:15,953 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:18:15,954 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-21 17:18:16,013 WARN L859 $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-21 17:18:16,042 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:18:16,042 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-21 17:18:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-21 17:18:16,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:18:16,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579182418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:16,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:18:16,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2022-11-21 17:18:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176753592] [2022-11-21 17:18:16,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:18:16,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 17:18:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 17:18:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2022-11-21 17:18:16,520 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-21 17:18:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:16,960 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-21 17:18:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:18:16,961 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-21 17:18:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:16,961 INFO L225 Difference]: With dead ends: 116 [2022-11-21 17:18:16,962 INFO L226 Difference]: Without dead ends: 116 [2022-11-21 17:18:16,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=363, Unknown=4, NotChecked=172, Total=650 [2022-11-21 17:18:16,963 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 345 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:16,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 229 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 277 Invalid, 0 Unknown, 402 Unchecked, 0.3s Time] [2022-11-21 17:18:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-21 17:18:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-11-21 17:18:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 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-21 17:18:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-11-21 17:18:16,978 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 37 [2022-11-21 17:18:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:16,979 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-11-21 17:18:16,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-21 17:18:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-11-21 17:18:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 17:18:16,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:16,981 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-21 17:18:16,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:18:17,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-21 17:18:17,188 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2022-11-21 17:18:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:17,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226716178] [2022-11-21 17:18:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:17,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:17,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:17,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:18:17,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:17,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226716178] [2022-11-21 17:18:17,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226716178] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:17,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112539881] [2022-11-21 17:18:17,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:17,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:17,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:17,925 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:17,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:18:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:18,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 17:18:18,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:18,119 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-21 17:18:18,141 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-21 17:18:18,163 WARN L859 $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_686 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_686) |c_#length|)))) is different from true [2022-11-21 17:18:18,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:18,216 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-21 17:18:18,243 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-21 17:18:18,258 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_687 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_687))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-21 17:18:18,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:18,305 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-21 17:18:18,368 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-21 17:18:18,378 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-21 17:18:18,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:18,421 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-21 17:18:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-21 17:18:18,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:18:18,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112539881] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:18,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:18:18,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-21 17:18:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012648015] [2022-11-21 17:18:18,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:18:18,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 17:18:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 17:18:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-11-21 17:18:18,529 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-21 17:18:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:18,935 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-11-21 17:18:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:18:18,936 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-21 17:18:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:18,936 INFO L225 Difference]: With dead ends: 108 [2022-11-21 17:18:18,937 INFO L226 Difference]: Without dead ends: 108 [2022-11-21 17:18:18,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-11-21 17:18:18,938 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 285 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:18,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 203 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 274 Invalid, 0 Unknown, 273 Unchecked, 0.3s Time] [2022-11-21 17:18:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-21 17:18:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2022-11-21 17:18:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 85 states have internal predecessors, (92), 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-21 17:18:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-11-21 17:18:18,942 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 37 [2022-11-21 17:18:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:18,947 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-11-21 17:18:18,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-21 17:18:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-11-21 17:18:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 17:18:18,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:18,949 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-21 17:18:18,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:18:19,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:19,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2022-11-21 17:18:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:19,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568127821] [2022-11-21 17:18:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:19,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:19,324 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-21 17:18:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:19,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568127821] [2022-11-21 17:18:19,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568127821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:18:19,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:18:19,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:18:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853614522] [2022-11-21 17:18:19,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:18:19,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:18:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:19,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:18:19,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:18:19,326 INFO L87 Difference]: Start difference. First operand 90 states and 98 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-21 17:18:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:19,518 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-11-21 17:18:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:18:19,518 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-21 17:18:19,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:19,519 INFO L225 Difference]: With dead ends: 106 [2022-11-21 17:18:19,519 INFO L226 Difference]: Without dead ends: 106 [2022-11-21 17:18:19,519 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-21 17:18:19,520 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:19,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 266 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:18:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-21 17:18:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-11-21 17:18:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 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-21 17:18:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-11-21 17:18:19,524 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 39 [2022-11-21 17:18:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:19,524 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-11-21 17:18:19,524 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-21 17:18:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-11-21 17:18:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 17:18:19,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:19,525 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-21 17:18:19,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:18:19,525 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:19,526 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2022-11-21 17:18:19,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:19,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387938074] [2022-11-21 17:18:19,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:19,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:19,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:19,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:19,805 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-21 17:18:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:19,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387938074] [2022-11-21 17:18:19,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387938074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:18:19,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:18:19,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:18:19,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877869214] [2022-11-21 17:18:19,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:18:19,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:18:19,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:19,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:18:19,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:18:19,808 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-21 17:18:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:19,994 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-11-21 17:18:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:18:19,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-21 17:18:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:19,995 INFO L225 Difference]: With dead ends: 86 [2022-11-21 17:18:19,995 INFO L226 Difference]: Without dead ends: 86 [2022-11-21 17:18:19,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:18:19,996 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 74 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:19,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 284 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:18:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-21 17:18:19,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-21 17:18:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 81 states have internal predecessors, (88), 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-21 17:18:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-11-21 17:18:20,004 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 39 [2022-11-21 17:18:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:20,004 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-11-21 17:18:20,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-21 17:18:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-11-21 17:18:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 17:18:20,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:20,006 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-21 17:18:20,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 17:18:20,006 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2022-11-21 17:18:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:20,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590457631] [2022-11-21 17:18:20,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:20,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:20,766 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-21 17:18:20,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:20,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590457631] [2022-11-21 17:18:20,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590457631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:20,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380487008] [2022-11-21 17:18:20,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:20,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:20,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:20,768 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:20,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:18:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:20,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-21 17:18:20,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:21,210 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-21 17:18:21,337 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1044 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1044))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-21 17:18:21,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:21,369 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-21 17:18:21,382 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-21 17:18:21,382 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-21 17:18:21,475 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-21 17:18:21,493 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-21 17:18:21,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:18:21,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380487008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:18:21,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:18:21,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-21 17:18:21,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393776992] [2022-11-21 17:18:21,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:18:21,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 17:18:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 17:18:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-11-21 17:18:21,495 INFO L87 Difference]: Start difference. First operand 86 states and 94 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-21 17:18:22,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:22,102 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-11-21 17:18:22,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 17:18:22,103 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-21 17:18:22,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:22,104 INFO L225 Difference]: With dead ends: 128 [2022-11-21 17:18:22,104 INFO L226 Difference]: Without dead ends: 128 [2022-11-21 17:18:22,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2022-11-21 17:18:22,105 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 84 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:22,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 665 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 580 Invalid, 3 Unknown, 156 Unchecked, 0.5s Time] [2022-11-21 17:18:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-21 17:18:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 85. [2022-11-21 17:18:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 80 states have internal predecessors, (88), 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-21 17:18:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2022-11-21 17:18:22,108 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 41 [2022-11-21 17:18:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:22,108 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2022-11-21 17:18:22,109 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-21 17:18:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2022-11-21 17:18:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 17:18:22,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:22,109 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-21 17:18:22,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:18:22,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-21 17:18:22,310 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash -372386586, now seen corresponding path program 1 times [2022-11-21 17:18:22,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:22,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171010171] [2022-11-21 17:18:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:22,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:22,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:23,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:23,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:23,534 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-21 17:18:23,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:23,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171010171] [2022-11-21 17:18:23,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171010171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:23,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807194896] [2022-11-21 17:18:23,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:23,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:23,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:23,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:23,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:18:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:23,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-21 17:18:23,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:24,240 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-21 17:18:24,244 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-21 17:18:24,455 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1203 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1203))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1199 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1199) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1202 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1202))))) is different from true [2022-11-21 17:18:24,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:24,537 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-21 17:18:24,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:24,546 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 16 treesize of output 18 [2022-11-21 17:18:24,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:24,554 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-21 17:18:24,566 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:18:24,566 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-21 17:18:24,644 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-21 17:18:24,647 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-21 17:18:24,727 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-21 17:18:24,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:18:25,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807194896] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:25,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:18:25,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-11-21 17:18:25,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856201756] [2022-11-21 17:18:25,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:18:25,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-21 17:18:25,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:25,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-21 17:18:25,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2022-11-21 17:18:25,891 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 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-21 17:18:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:28,560 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2022-11-21 17:18:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 17:18:28,561 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 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-21 17:18:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:28,562 INFO L225 Difference]: With dead ends: 140 [2022-11-21 17:18:28,562 INFO L226 Difference]: Without dead ends: 140 [2022-11-21 17:18:28,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=331, Invalid=2638, Unknown=5, NotChecked=106, Total=3080 [2022-11-21 17:18:28,564 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 444 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:28,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1257 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1304 Invalid, 3 Unknown, 150 Unchecked, 1.3s Time] [2022-11-21 17:18:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-21 17:18:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 89. [2022-11-21 17:18:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 84 states have internal predecessors, (92), 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-21 17:18:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-11-21 17:18:28,568 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2022-11-21 17:18:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:28,568 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-11-21 17:18:28,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 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-21 17:18:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-11-21 17:18:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 17:18:28,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:28,569 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] [2022-11-21 17:18:28,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:18:28,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 17:18:28,770 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112687, now seen corresponding path program 1 times [2022-11-21 17:18:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:28,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273787436] [2022-11-21 17:18:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:29,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:29,088 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-21 17:18:29,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:29,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273787436] [2022-11-21 17:18:29,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273787436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:18:29,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:18:29,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 17:18:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915540649] [2022-11-21 17:18:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:18:29,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 17:18:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:29,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 17:18:29,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:18:29,091 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-21 17:18:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:29,421 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-11-21 17:18:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 17:18:29,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 44 [2022-11-21 17:18:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:29,422 INFO L225 Difference]: With dead ends: 152 [2022-11-21 17:18:29,422 INFO L226 Difference]: Without dead ends: 152 [2022-11-21 17:18:29,423 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-21 17:18:29,423 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 274 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:29,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 398 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:18:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-21 17:18:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2022-11-21 17:18:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.391304347826087) internal successors, (96), 87 states have internal predecessors, (96), 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-21 17:18:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-11-21 17:18:29,427 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 44 [2022-11-21 17:18:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:29,427 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-11-21 17:18:29,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-21 17:18:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-11-21 17:18:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 17:18:29,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:29,428 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] [2022-11-21 17:18:29,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 17:18:29,428 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112688, now seen corresponding path program 1 times [2022-11-21 17:18:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:29,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662743340] [2022-11-21 17:18:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:29,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:29,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:29,939 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-21 17:18:29,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:29,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662743340] [2022-11-21 17:18:29,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662743340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:18:29,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:18:29,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 17:18:29,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707911512] [2022-11-21 17:18:29,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:18:29,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 17:18:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:29,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 17:18:29,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:18:29,942 INFO L87 Difference]: Start difference. First operand 92 states and 102 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-21 17:18:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:30,329 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-11-21 17:18:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 17:18:30,330 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 44 [2022-11-21 17:18:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:30,331 INFO L225 Difference]: With dead ends: 134 [2022-11-21 17:18:30,331 INFO L226 Difference]: Without dead ends: 134 [2022-11-21 17:18:30,331 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-21 17:18:30,332 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 279 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:30,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 411 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:18:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-21 17:18:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2022-11-21 17:18:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.380281690140845) internal successors, (98), 89 states have internal predecessors, (98), 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-21 17:18:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-11-21 17:18:30,336 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 44 [2022-11-21 17:18:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:30,337 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-11-21 17:18:30,337 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-21 17:18:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-11-21 17:18:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 17:18:30,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:30,338 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-21 17:18:30,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 17:18:30,339 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash 614432594, now seen corresponding path program 1 times [2022-11-21 17:18:30,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:30,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923499588] [2022-11-21 17:18:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:30,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:30,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:30,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:30,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:30,897 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-21 17:18:30,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:30,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923499588] [2022-11-21 17:18:30,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923499588] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:30,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906772997] [2022-11-21 17:18:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:30,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:30,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:30,899 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:30,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:18:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:31,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-21 17:18:31,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:31,509 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-21 17:18:31,586 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1614 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |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_1614)))) is different from true [2022-11-21 17:18:31,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:31,633 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 24 treesize of output 24 [2022-11-21 17:18:31,679 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 25 treesize of output 13 [2022-11-21 17:18:31,705 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-21 17:18:31,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:18:31,801 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array Int Int)) (|v_node_create_~temp~0#1.base_41| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_41| v_ArrVal_1618) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (<= 1 .cse0) (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_41| |c_#StackHeapBarrier|))))) is different from false [2022-11-21 17:18:31,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906772997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:31,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:18:31,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-21 17:18:31,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083535013] [2022-11-21 17:18:31,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:18:31,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-21 17:18:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:31,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 17:18:31,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-11-21 17:18:31,805 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 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-21 17:18:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:32,536 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-11-21 17:18:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 17:18:32,536 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 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 46 [2022-11-21 17:18:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:32,537 INFO L225 Difference]: With dead ends: 90 [2022-11-21 17:18:32,537 INFO L226 Difference]: Without dead ends: 90 [2022-11-21 17:18:32,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2022-11-21 17:18:32,538 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 392 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:32,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 591 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 418 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2022-11-21 17:18:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-21 17:18:32,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2022-11-21 17:18:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 81 states have internal predecessors, (88), 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-21 17:18:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-11-21 17:18:32,541 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 46 [2022-11-21 17:18:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:32,542 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-11-21 17:18:32,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 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-21 17:18:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-11-21 17:18:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 17:18:32,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:32,544 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-21 17:18:32,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:18:32,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 17:18:32,746 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450120, now seen corresponding path program 1 times [2022-11-21 17:18:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:32,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813038024] [2022-11-21 17:18:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:33,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:33,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:34,433 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-21 17:18:34,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:34,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813038024] [2022-11-21 17:18:34,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813038024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:34,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928757218] [2022-11-21 17:18:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:34,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:34,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:34,435 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:34,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 17:18:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:34,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-21 17:18:34,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:34,745 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-21 17:18:35,081 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:18:35,081 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-21 17:18:35,245 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-21 17:18:35,432 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:18:35,432 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-21 17:18:35,675 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:18:35,676 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-21 17:18:35,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2022-11-21 17:18:35,884 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1782 (Array Int Int)) (v_ArrVal_1781 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |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_1782)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1781)))) is different from true [2022-11-21 17:18:35,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:35,959 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:18:35,963 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-21 17:18:35,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:35,973 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-21 17:18:36,012 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-21 17:18:36,014 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-21 17:18:36,125 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-21 17:18:36,320 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:18:36,320 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-21 17:18:36,446 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-21 17:18:36,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:18:36,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928757218] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:36,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:18:36,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-11-21 17:18:36,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646441505] [2022-11-21 17:18:36,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:18:36,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-21 17:18:36,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:36,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-21 17:18:36,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1918, Unknown=1, NotChecked=88, Total=2162 [2022-11-21 17:18:36,671 INFO L87 Difference]: Start difference. First operand 86 states and 94 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-21 17:18:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:39,359 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2022-11-21 17:18:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 17:18:39,359 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-21 17:18:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:39,360 INFO L225 Difference]: With dead ends: 183 [2022-11-21 17:18:39,361 INFO L226 Difference]: Without dead ends: 183 [2022-11-21 17:18:39,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=383, Invalid=3402, Unknown=1, NotChecked=120, Total=3906 [2022-11-21 17:18:39,363 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 572 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:39,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1079 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1613 Invalid, 0 Unknown, 184 Unchecked, 1.5s Time] [2022-11-21 17:18:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-21 17:18:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2022-11-21 17:18:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 17:18:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-11-21 17:18:39,367 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 46 [2022-11-21 17:18:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:39,368 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-11-21 17:18:39,368 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-21 17:18:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-11-21 17:18:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 17:18:39,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:39,369 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-21 17:18:39,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:18:39,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 17:18:39,570 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450121, now seen corresponding path program 1 times [2022-11-21 17:18:39,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:39,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594992486] [2022-11-21 17:18:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:41,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:41,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:18:42,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:42,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594992486] [2022-11-21 17:18:42,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594992486] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:42,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32250458] [2022-11-21 17:18:42,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:42,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:42,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:42,082 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:42,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 17:18:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:42,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-21 17:18:42,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:42,379 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-21 17:18:42,859 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:18:42,860 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-21 17:18:43,048 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-21 17:18:43,054 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-21 17:18:43,331 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:18:43,331 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-21 17:18:43,337 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-21 17:18:43,673 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:18:43,674 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-21 17:18:43,682 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 5 treesize of output 3 [2022-11-21 17:18:43,688 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-21 17:18:43,694 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:18:43,913 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1959)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1960) |c_#memory_$Pointer$.offset|) (= (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-21 17:18:43,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:43,976 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:18:43,976 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-21 17:18:43,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:43,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:43,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:43,990 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-21 17:18:44,014 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 17:18:44,014 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-21 17:18:44,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-21 17:18:44,452 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-21 17:18:44,453 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-21 17:18:44,462 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 17:18:44,462 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-21 17:18:44,591 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-21 17:18:44,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:18:45,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32250458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:45,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:18:45,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 51 [2022-11-21 17:18:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830737685] [2022-11-21 17:18:45,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:18:45,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-21 17:18:45,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:18:45,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-21 17:18:45,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3016, Unknown=1, NotChecked=110, Total=3306 [2022-11-21 17:18:45,310 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 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-21 17:18:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:18:52,546 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2022-11-21 17:18:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-21 17:18:52,546 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 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-21 17:18:52,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:18:52,548 INFO L225 Difference]: With dead ends: 215 [2022-11-21 17:18:52,548 INFO L226 Difference]: Without dead ends: 215 [2022-11-21 17:18:52,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=534, Invalid=5475, Unknown=1, NotChecked=152, Total=6162 [2022-11-21 17:18:52,550 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 618 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-21 17:18:52,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 2355 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3163 Invalid, 0 Unknown, 149 Unchecked, 2.9s Time] [2022-11-21 17:18:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-21 17:18:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 105. [2022-11-21 17:18:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3375) internal successors, (107), 98 states have internal predecessors, (107), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 17:18:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-11-21 17:18:52,555 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 46 [2022-11-21 17:18:52,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:18:52,556 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-11-21 17:18:52,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 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-21 17:18:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-11-21 17:18:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 17:18:52,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:18:52,557 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-21 17:18:52,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:18:52,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 17:18:52,765 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:18:52,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:18:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash 865523061, now seen corresponding path program 1 times [2022-11-21 17:18:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:18:52,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139953575] [2022-11-21 17:18:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:18:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:53,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:18:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:18:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:53,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:18:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:54,098 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-21 17:18:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:18:54,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139953575] [2022-11-21 17:18:54,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139953575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:18:54,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519089001] [2022-11-21 17:18:54,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:18:54,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:18:54,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:18:54,100 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:18:54,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 17:18:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:18:54,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-21 17:18:54,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:18:54,411 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-21 17:18:54,457 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-21 17:18:54,491 WARN L859 $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-21 17:18:54,518 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:18:54,518 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-21 17:18:54,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 5 treesize of output 3 [2022-11-21 17:18:54,672 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:18:54,672 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-21 17:18:55,076 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 18 treesize of output 10 [2022-11-21 17:18:55,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:55,455 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 24 treesize of output 24 [2022-11-21 17:18:55,481 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 17:18:55,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 29 [2022-11-21 17:18:55,914 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:18:55,914 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 36 treesize of output 35 [2022-11-21 17:18:56,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:18:56,011 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 32 treesize of output 30 [2022-11-21 17:18:56,082 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 25 treesize of output 13 [2022-11-21 17:18:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-21 17:18:56,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:19:00,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2155 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2155) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-21 17:19:06,473 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int)) (v_ArrVal_2155 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2155) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-21 17:19:08,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519089001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:08,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:19:08,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2022-11-21 17:19:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390842421] [2022-11-21 17:19:08,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:19:08,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-21 17:19:08,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:19:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-21 17:19:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2229, Unknown=71, NotChecked=294, Total=2756 [2022-11-21 17:19:08,911 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 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-21 17:19:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:19:12,839 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2022-11-21 17:19:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 17:19:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 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 51 [2022-11-21 17:19:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:19:12,842 INFO L225 Difference]: With dead ends: 216 [2022-11-21 17:19:12,842 INFO L226 Difference]: Without dead ends: 216 [2022-11-21 17:19:12,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=631, Invalid=4710, Unknown=73, NotChecked=438, Total=5852 [2022-11-21 17:19:12,844 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1847 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:19:12,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 854 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1404 Invalid, 2 Unknown, 109 Unchecked, 1.3s Time] [2022-11-21 17:19:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-21 17:19:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 106. [2022-11-21 17:19:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 17:19:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-11-21 17:19:12,850 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 51 [2022-11-21 17:19:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:19:12,850 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-11-21 17:19:12,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 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-21 17:19:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-11-21 17:19:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 17:19:12,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:19:12,851 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-21 17:19:12,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-21 17:19:13,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:19:13,059 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:19:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:19:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 865523062, now seen corresponding path program 1 times [2022-11-21 17:19:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:19:13,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488647860] [2022-11-21 17:19:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:19:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:19:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:19:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:14,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:19:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:15,022 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-21 17:19:15,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:19:15,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488647860] [2022-11-21 17:19:15,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488647860] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:15,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247793409] [2022-11-21 17:19:15,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:15,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:19:15,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:19:15,024 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:19:15,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 17:19:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:15,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-21 17:19:15,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:19:15,290 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-21 17:19:15,350 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-21 17:19:15,389 WARN L859 $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-21 17:19:15,423 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:19:15,424 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-21 17:19:15,503 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-21 17:19:15,648 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:19:15,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:19:16,179 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 33 treesize of output 21 [2022-11-21 17:19:16,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 11 [2022-11-21 17:19:16,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:16,564 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 41 treesize of output 32 [2022-11-21 17:19:16,575 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:19:16,575 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 17:19:16,599 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 24 treesize of output 19 [2022-11-21 17:19:16,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:16,605 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 31 treesize of output 24 [2022-11-21 17:19:17,118 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:19:17,119 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 52 treesize of output 49 [2022-11-21 17:19:17,131 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 33 treesize of output 33 [2022-11-21 17:19:17,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:17,260 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 38 treesize of output 36 [2022-11-21 17:19:17,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:17,270 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 29 treesize of output 29 [2022-11-21 17:19:17,372 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 31 treesize of output 19 [2022-11-21 17:19:17,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 14 [2022-11-21 17:19:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-21 17:19:17,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:19:17,743 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-21 17:19:19,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247793409] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:19,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:19:19,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2022-11-21 17:19:19,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668788070] [2022-11-21 17:19:19,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:19:19,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-21 17:19:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:19:19,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-21 17:19:19,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2529, Unknown=48, NotChecked=206, Total=2970 [2022-11-21 17:19:19,309 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 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-21 17:19:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:19:23,548 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2022-11-21 17:19:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 17:19:23,548 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 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 51 [2022-11-21 17:19:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:19:23,550 INFO L225 Difference]: With dead ends: 197 [2022-11-21 17:19:23,550 INFO L226 Difference]: Without dead ends: 197 [2022-11-21 17:19:23,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=487, Invalid=4165, Unknown=48, NotChecked=270, Total=4970 [2022-11-21 17:19:23,551 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1476 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:19:23,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 844 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1557 Invalid, 0 Unknown, 153 Unchecked, 1.5s Time] [2022-11-21 17:19:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-21 17:19:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 119. [2022-11-21 17:19:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 112 states have internal predecessors, (124), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 17:19:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2022-11-21 17:19:23,563 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 51 [2022-11-21 17:19:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:19:23,563 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2022-11-21 17:19:23,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 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-21 17:19:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2022-11-21 17:19:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 17:19:23,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:19:23,565 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-21 17:19:23,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 17:19:23,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:19:23,772 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:19:23,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:19:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash -396596539, now seen corresponding path program 2 times [2022-11-21 17:19:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:19:23,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669870819] [2022-11-21 17:19:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:19:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:25,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:19:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:25,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:19:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:25,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:19:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:19:25,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:19:25,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669870819] [2022-11-21 17:19:25,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669870819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:25,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778823951] [2022-11-21 17:19:25,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:19:25,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:19:25,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:19:25,951 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:19:25,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 17:19:26,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:19:26,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:19:26,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 145 conjunts are in the unsatisfiable core [2022-11-21 17:19:26,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:19:26,246 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-21 17:19:26,605 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:19:26,606 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-21 17:19:26,745 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-21 17:19:26,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:19:26,954 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 17:19:26,954 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-21 17:19:26,962 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-21 17:19:27,759 INFO L321 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-11-21 17:19:27,759 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-21 17:19:27,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:27,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:27,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:27,786 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-21 17:19:27,786 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-21 17:19:27,810 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-21 17:19:27,810 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-21 17:19:29,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:29,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:29,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:29,702 INFO L321 Elim1Store]: treesize reduction 78, result has 8.2 percent of original size [2022-11-21 17:19:29,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 42 [2022-11-21 17:19:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:19:29,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:19:33,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778823951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:33,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:19:33,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2022-11-21 17:19:33,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345070587] [2022-11-21 17:19:33,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:19:33,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-21 17:19:33,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:19:33,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-21 17:19:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3919, Unknown=3, NotChecked=0, Total=4160 [2022-11-21 17:19:33,759 INFO L87 Difference]: Start difference. First operand 119 states and 134 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-21 17:19:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:19:38,925 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2022-11-21 17:19:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 17:19:38,926 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-21 17:19:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:19:38,927 INFO L225 Difference]: With dead ends: 121 [2022-11-21 17:19:38,927 INFO L226 Difference]: Without dead ends: 121 [2022-11-21 17:19:38,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1929 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=532, Invalid=7121, Unknown=3, NotChecked=0, Total=7656 [2022-11-21 17:19:38,928 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 250 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:19:38,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1685 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1892 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-21 17:19:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-21 17:19:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-11-21 17:19:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 112 states have internal predecessors, (123), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 17:19:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2022-11-21 17:19:38,933 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 51 [2022-11-21 17:19:38,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:19:38,934 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2022-11-21 17:19:38,934 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-21 17:19:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2022-11-21 17:19:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 17:19:38,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:19:38,935 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-21 17:19:38,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 17:19:39,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-21 17:19:39,139 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:19:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:19:39,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1455991656, now seen corresponding path program 1 times [2022-11-21 17:19:39,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:19:39,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914447872] [2022-11-21 17:19:39,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:39,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:19:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:39,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:19:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:39,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:19:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:19:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:40,511 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-21 17:19:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:19:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914447872] [2022-11-21 17:19:40,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914447872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427978649] [2022-11-21 17:19:40,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:40,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:19:40,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:19:40,514 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:19:40,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 17:19:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:40,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-21 17:19:40,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:19:40,831 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-21 17:19:41,099 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:19:41,099 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-21 17:19:41,262 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-21 17:19:41,443 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:19:41,443 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 19 treesize of output 22 [2022-11-21 17:19:41,660 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:19:41,661 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 33 treesize of output 16 [2022-11-21 17:19:41,671 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-21 17:19:41,675 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-21 17:19:41,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:41,937 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 17:19:41,938 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 43 treesize of output 38 [2022-11-21 17:19:41,952 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:19:41,952 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-21 17:19:41,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:41,959 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 16 treesize of output 11 [2022-11-21 17:19:42,440 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-21 17:19:42,440 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 59 treesize of output 29 [2022-11-21 17:19:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:19:42,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:19:42,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427978649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:42,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:19:42,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2022-11-21 17:19:42,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706423045] [2022-11-21 17:19:42,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:19:42,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-21 17:19:42,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:19:42,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-21 17:19:42,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2581, Unknown=0, NotChecked=0, Total=2756 [2022-11-21 17:19:42,998 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 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-21 17:19:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:19:45,758 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-11-21 17:19:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 17:19:45,761 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 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 53 [2022-11-21 17:19:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:19:45,762 INFO L225 Difference]: With dead ends: 120 [2022-11-21 17:19:45,763 INFO L226 Difference]: Without dead ends: 120 [2022-11-21 17:19:45,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=339, Invalid=4217, Unknown=0, NotChecked=0, Total=4556 [2022-11-21 17:19:45,764 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 153 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:19:45,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1593 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-21 17:19:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-21 17:19:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-11-21 17:19:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.297872340425532) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 17:19:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-11-21 17:19:45,769 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 53 [2022-11-21 17:19:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:19:45,770 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-11-21 17:19:45,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 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-21 17:19:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-11-21 17:19:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 17:19:45,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:19:45,771 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] [2022-11-21 17:19:45,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 17:19:45,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:19:45,975 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:19:45,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:19:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1874385561, now seen corresponding path program 1 times [2022-11-21 17:19:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:19:45,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927183325] [2022-11-21 17:19:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:19:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:47,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:19:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:47,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:19:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:47,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:19:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:48,277 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-21 17:19:48,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:19:48,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927183325] [2022-11-21 17:19:48,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927183325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:19:48,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55930187] [2022-11-21 17:19:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:19:48,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:19:48,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:19:48,283 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:19:48,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 17:19:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:19:48,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-21 17:19:48,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:19:48,585 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-21 17:19:48,635 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-21 17:19:48,677 WARN L859 $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_2922 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2922))))) is different from true [2022-11-21 17:19:48,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:48,723 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-21 17:19:48,753 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-21 17:19:49,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:49,029 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-21 17:19:49,680 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-21 17:19:49,688 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-21 17:19:49,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:49,697 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-21 17:19:49,702 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-21 17:19:50,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:50,218 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-21 17:19:50,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:50,235 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-21 17:19:50,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:50,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:50,276 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 17:19:50,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2022-11-21 17:19:50,303 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:19:50,303 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-21 17:19:51,469 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-21 17:19:51,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 57 [2022-11-21 17:19:51,501 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-21 17:19:51,502 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 38 treesize of output 33 [2022-11-21 17:19:52,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:52,078 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:19:52,078 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 98 treesize of output 101 [2022-11-21 17:19:52,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:19:52,106 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:19:52,106 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 103 treesize of output 110 [2022-11-21 17:19:52,186 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-21 17:19:52,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 5 treesize of output 3 [2022-11-21 17:19:52,319 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-21 17:19:52,804 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-21 17:19:52,810 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 34 treesize of output 18 [2022-11-21 17:19:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-21 17:19:53,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:19:53,271 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-21 17:19:53,292 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-21 17:20:07,190 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2945 Int)) (or (not (<= 8 v_ArrVal_2945)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (forall ((v_ArrVal_2944 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2944))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_subst_2 Int)) (or (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse1 v_subst_2 (store (select .cse1 v_subst_2) .cse0 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (<= (+ .cse0 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2945) v_subst_2))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0)))))) (forall ((v_ArrVal_2945 Int)) (or (not (<= 8 v_ArrVal_2945)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2944))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 0 .cse2)) (forall ((v_subst_1 Int)) (let ((.cse4 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2945))) (or (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ 8 (select (select (store (store .cse3 v_subst_1 (store (select .cse3 v_subst_1) .cse2 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse4 (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2943))) (store .cse5 v_subst_1 (store (select .cse5 v_subst_1) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (<= (+ .cse2 4) (select .cse4 v_subst_1)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0))))))) is different from false [2022-11-21 17:20:07,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55930187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:20:07,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:20:07,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 51 [2022-11-21 17:20:07,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356950544] [2022-11-21 17:20:07,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:20:07,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-21 17:20:07,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:20:07,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-21 17:20:07,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3175, Unknown=7, NotChecked=468, Total=3906 [2022-11-21 17:20:07,199 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 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-21 17:20:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:20:16,902 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2022-11-21 17:20:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-21 17:20:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 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 56 [2022-11-21 17:20:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:20:16,903 INFO L225 Difference]: With dead ends: 181 [2022-11-21 17:20:16,904 INFO L226 Difference]: Without dead ends: 181 [2022-11-21 17:20:16,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=701, Invalid=6280, Unknown=7, NotChecked=668, Total=7656 [2022-11-21 17:20:16,906 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 695 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 38 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:20:16,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1841 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2658 Invalid, 2 Unknown, 149 Unchecked, 4.2s Time] [2022-11-21 17:20:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-21 17:20:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 105. [2022-11-21 17:20:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 98 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-21 17:20:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2022-11-21 17:20:16,911 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 56 [2022-11-21 17:20:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:20:16,911 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2022-11-21 17:20:16,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 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-21 17:20:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-11-21 17:20:16,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 17:20:16,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:20:16,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:20:16,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 17:20:17,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:20:17,120 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:20:17,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:20:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1773529958, now seen corresponding path program 3 times [2022-11-21 17:20:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:20:17,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589830856] [2022-11-21 17:20:17,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:20:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:20:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:20:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:17,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:20:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 17:20:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:17,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 17:20:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-21 17:20:17,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:20:17,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589830856] [2022-11-21 17:20:17,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589830856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:20:17,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273718637] [2022-11-21 17:20:17,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:20:17,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:20:17,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:20:17,289 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:20:17,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 17:20:17,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-21 17:20:17,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:20:17,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:20:17,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:20:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 17:20:17,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:20:17,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273718637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:20:17,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:20:17,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-21 17:20:17,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451620422] [2022-11-21 17:20:17,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:20:17,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:20:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:20:17,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:20:17,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:20:17,740 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-21 17:20:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:20:17,758 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-11-21 17:20:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:20:17,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 58 [2022-11-21 17:20:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:20:17,759 INFO L225 Difference]: With dead ends: 83 [2022-11-21 17:20:17,759 INFO L226 Difference]: Without dead ends: 83 [2022-11-21 17:20:17,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 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-21 17:20:17,760 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 128 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 93 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-21 17:20:17,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 93 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:20:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-21 17:20:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-21 17:20:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 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-21 17:20:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-21 17:20:17,765 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 58 [2022-11-21 17:20:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:20:17,765 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-21 17:20:17,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-21 17:20:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-21 17:20:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 17:20:17,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:20:17,766 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-21 17:20:17,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-21 17:20:17,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-21 17:20:17,967 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:20:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:20:17,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228283, now seen corresponding path program 1 times [2022-11-21 17:20:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:20:17,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779558054] [2022-11-21 17:20:17,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:20:17,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:20:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:20:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:20,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:20:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:21,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:20:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:22,767 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-21 17:20:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:20:22,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779558054] [2022-11-21 17:20:22,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779558054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:20:22,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463268971] [2022-11-21 17:20:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:20:22,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:20:22,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:20:22,769 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:20:22,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-21 17:20:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:23,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 166 conjunts are in the unsatisfiable core [2022-11-21 17:20:23,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:20:23,143 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-21 17:20:23,275 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-21 17:20:23,669 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:20:23,670 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-21 17:20:24,097 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-21 17:20:24,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:20:24,481 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:20:24,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:20:24,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:20:24,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:24,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 17:20:24,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:20:25,493 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:20:25,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-21 17:20:25,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 17:20:25,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 17:20:26,172 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:20:26,173 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 60 treesize of output 35 [2022-11-21 17:20:26,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2022-11-21 17:20:26,187 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:20:26,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:26,994 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 17:20:26,994 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 68 treesize of output 55 [2022-11-21 17:20:27,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:27,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:27,026 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-21 17:20:27,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-11-21 17:20:27,067 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:20:27,067 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-21 17:20:27,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-11-21 17:20:29,382 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:20:29,383 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 113 treesize of output 92 [2022-11-21 17:20:29,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:29,417 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:20:29,418 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 55 treesize of output 59 [2022-11-21 17:20:29,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:29,430 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 30 treesize of output 32 [2022-11-21 17:20:29,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:29,651 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:20:29,651 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 65 treesize of output 59 [2022-11-21 17:20:29,661 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-21 17:20:29,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:29,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:29,675 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-21 17:20:29,873 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:20:29,874 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 58 treesize of output 33 [2022-11-21 17:20:29,879 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 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-21 17:20:30,142 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-21 17:20:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:20:30,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:20:30,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3354) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3351) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-21 17:20:32,819 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| Int) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3366 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3367 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3368 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3367)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3368))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3366) .cse0 v_ArrVal_3352) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3354) (select (select (store (store .cse1 .cse0 v_ArrVal_3351) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_3353) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (<= 0 (select (select .cse2 .cse3) .cse4))))))) is different from false [2022-11-21 17:20:32,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463268971] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:20:32,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:20:32,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2022-11-21 17:20:32,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362997558] [2022-11-21 17:20:32,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:20:32,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-21 17:20:32,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:20:32,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-21 17:20:32,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=5204, Unknown=49, NotChecked=294, Total=5852 [2022-11-21 17:20:32,826 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 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-21 17:20:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:20:40,819 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-11-21 17:20:40,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 17:20:40,819 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 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 58 [2022-11-21 17:20:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:20:40,820 INFO L225 Difference]: With dead ends: 102 [2022-11-21 17:20:40,820 INFO L226 Difference]: Without dead ends: 102 [2022-11-21 17:20:40,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=743, Invalid=8526, Unknown=51, NotChecked=382, Total=9702 [2022-11-21 17:20:40,823 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 615 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:20:40,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1026 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-21 17:20:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-21 17:20:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-11-21 17:20:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 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-21 17:20:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-21 17:20:40,826 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 58 [2022-11-21 17:20:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:20:40,827 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-21 17:20:40,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 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-21 17:20:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-21 17:20:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-21 17:20:40,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:20:40,828 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] [2022-11-21 17:20:40,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-21 17:20:41,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:20:41,036 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:20:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:20:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478905, now seen corresponding path program 1 times [2022-11-21 17:20:41,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:20:41,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908632098] [2022-11-21 17:20:41,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:20:41,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:20:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:43,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:20:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:20:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:43,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:20:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:44,305 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-21 17:20:44,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:20:44,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908632098] [2022-11-21 17:20:44,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908632098] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:20:44,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363261697] [2022-11-21 17:20:44,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:20:44,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:20:44,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:20:44,308 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:20:44,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-21 17:20:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:20:44,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-21 17:20:44,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:20:44,648 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-21 17:20:44,739 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-21 17:20:45,035 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:20:45,035 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-21 17:20:45,259 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-21 17:20:45,476 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:20:45,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:20:45,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:20:46,051 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:20:46,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-21 17:20:46,471 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:20:46,472 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 38 treesize of output 21 [2022-11-21 17:20:46,479 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 5 treesize of output 3 [2022-11-21 17:20:46,484 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-21 17:20:46,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:46,998 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 17:20:46,998 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 46 treesize of output 37 [2022-11-21 17:20:47,011 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:20:47,011 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-21 17:20:47,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:47,034 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 16 treesize of output 11 [2022-11-21 17:20:48,356 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:20:48,356 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 90 treesize of output 73 [2022-11-21 17:20:48,379 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:20:48,379 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 43 treesize of output 44 [2022-11-21 17:20:48,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:48,576 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:20:48,576 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 60 treesize of output 52 [2022-11-21 17:20:48,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:20:48,588 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 31 treesize of output 31 [2022-11-21 17:20:48,749 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-21 17:20:49,084 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:20:49,085 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 53 treesize of output 24 [2022-11-21 17:20:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:20:49,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:20:49,134 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-21 17:20:49,149 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-21 17:20:49,181 INFO L321 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2022-11-21 17:20:49,182 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 42 treesize of output 41 [2022-11-21 17:20:49,191 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) is different from false [2022-11-21 17:20:49,863 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-21 17:20:49,873 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-21 17:20:49,895 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-21 17:20:50,003 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| Int) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3567 (Array Int Int)) (v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3567)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3566))) (let ((.cse2 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store .cse1 .cse2 v_ArrVal_3557) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse3 .cse2 v_ArrVal_3556) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| |c_#StackHeapBarrier|)))) is different from false [2022-11-21 17:20:50,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363261697] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:20:50,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:20:50,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 63 [2022-11-21 17:20:50,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626649933] [2022-11-21 17:20:50,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:20:50,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-21 17:20:50,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:20:50,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-21 17:20:50,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=4008, Unknown=108, NotChecked=938, Total=5256 [2022-11-21 17:20:50,008 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 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-21 17:20:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:20:56,970 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-11-21 17:20:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-21 17:20:56,971 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 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 62 [2022-11-21 17:20:56,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:20:56,972 INFO L225 Difference]: With dead ends: 134 [2022-11-21 17:20:56,973 INFO L226 Difference]: Without dead ends: 134 [2022-11-21 17:20:56,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=605, Invalid=7139, Unknown=116, NotChecked=1260, Total=9120 [2022-11-21 17:20:56,974 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 909 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:20:56,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1124 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-21 17:20:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-21 17:20:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 87. [2022-11-21 17:20:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 82 states have internal predecessors, (88), 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-21 17:20:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-11-21 17:20:56,979 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 62 [2022-11-21 17:20:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:20:56,979 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-11-21 17:20:56,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 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-21 17:20:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-11-21 17:20:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-21 17:20:56,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:20:56,980 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] [2022-11-21 17:20:56,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-21 17:20:57,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-21 17:20:57,188 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:20:57,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:20:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478904, now seen corresponding path program 1 times [2022-11-21 17:20:57,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:20:57,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476438186] [2022-11-21 17:20:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:20:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:20:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:21:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:02,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:21:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:21:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:03,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476438186] [2022-11-21 17:21:03,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476438186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:21:03,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657192701] [2022-11-21 17:21:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:03,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:21:03,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:21:03,117 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:21:03,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-21 17:21:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:03,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-21 17:21:03,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:21:03,497 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-21 17:21:03,711 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-21 17:21:04,048 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:21:04,048 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-21 17:21:04,908 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-21 17:21:04,908 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 22 treesize of output 33 [2022-11-21 17:21:04,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 17:21:05,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:21:05,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:21:05,859 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:21:05,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2022-11-21 17:21:05,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 17:21:07,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:07,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 17:21:07,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:07,600 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:21:07,600 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 81 treesize of output 65 [2022-11-21 17:21:07,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:07,659 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-21 17:21:07,660 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 25 treesize of output 42 [2022-11-21 17:21:07,689 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-21 17:21:07,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:07,728 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-21 17:21:07,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-21 17:21:09,893 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:21:09,894 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2022-11-21 17:21:09,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:09,948 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:21:09,949 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2022-11-21 17:21:10,234 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:21:10,234 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 79 treesize of output 63 [2022-11-21 17:21:10,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:10,274 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 25 treesize of output 30 [2022-11-21 17:21:11,088 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-21 17:21:11,088 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 83 treesize of output 45 [2022-11-21 17:21:11,628 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 17:21:11,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-21 17:21:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:21:11,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:21:12,959 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3765 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1) 4))) (not (<= 0 .cse1)))))) (forall ((v_ArrVal_3765 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse2 .cse3) .cse4) 8) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))) (not (<= 0 .cse4))))))) is different from false [2022-11-21 17:21:13,775 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3762 (Array Int Int)) (v_ArrVal_3763 (Array Int Int)) (v_ArrVal_3765 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3762) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_3764 (Array Int Int))) (<= 0 (+ (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3763) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0) 4))))))) (forall ((v_ArrVal_3762 (Array Int Int)) (v_ArrVal_3763 (Array Int Int)) (v_ArrVal_3765 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3762) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3763) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse2 .cse3) .cse4) 8) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))) (not (<= 0 .cse4))))))) is different from false [2022-11-21 17:21:18,784 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (and (forall ((v_ArrVal_3762 (Array Int Int)) (v_ArrVal_3763 (Array Int Int)) (v_ArrVal_3765 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3762) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_3764 (Array Int Int))) (<= 0 (+ (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3763) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0) 4))))))) (forall ((v_ArrVal_3762 (Array Int Int)) (v_ArrVal_3763 (Array Int Int)) (v_ArrVal_3765 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3762) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3)) (forall ((v_ArrVal_3764 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3763) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse4 .cse5) .cse3) 8) (select |c_#length| (select (select .cse6 .cse5) .cse3)))))))))))) is different from false [2022-11-21 17:21:21,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657192701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:21:21,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:21:21,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35] total 76 [2022-11-21 17:21:21,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849947673] [2022-11-21 17:21:21,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:21:21,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-21 17:21:21,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:21,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-21 17:21:21,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=7154, Unknown=68, NotChecked=516, Total=8010 [2022-11-21 17:21:21,257 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 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-21 17:21:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:21:39,759 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-11-21 17:21:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-21 17:21:39,761 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 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 62 [2022-11-21 17:21:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:21:39,762 INFO L225 Difference]: With dead ends: 156 [2022-11-21 17:21:39,762 INFO L226 Difference]: Without dead ends: 156 [2022-11-21 17:21:39,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1879 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=920, Invalid=12134, Unknown=68, NotChecked=684, Total=13806 [2022-11-21 17:21:39,764 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2071 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2071 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:21:39,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2071 Valid, 1321 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3106 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-11-21 17:21:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-21 17:21:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 89. [2022-11-21 17:21:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 84 states have internal predecessors, (90), 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-21 17:21:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-11-21 17:21:39,768 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 62 [2022-11-21 17:21:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:21:39,769 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-11-21 17:21:39,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 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-21 17:21:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-11-21 17:21:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-21 17:21:39,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:21:39,770 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-21 17:21:39,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-21 17:21:39,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-21 17:21:39,985 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:21:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:21:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1350141375, now seen corresponding path program 1 times [2022-11-21 17:21:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:21:39,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548554114] [2022-11-21 17:21:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:39,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:21:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:21:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:21:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:21:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:44,592 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-21 17:21:44,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:21:44,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548554114] [2022-11-21 17:21:44,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548554114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:21:44,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193972487] [2022-11-21 17:21:44,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:21:44,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:21:44,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:21:44,594 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:21:44,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-21 17:21:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:21:45,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-21 17:21:45,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:21:45,050 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-21 17:21:45,216 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-21 17:21:45,662 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:21:45,662 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-21 17:21:46,019 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-21 17:21:46,374 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:21:46,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:21:46,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:21:47,313 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:21:47,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-21 17:21:48,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:21:48,045 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:21:48,045 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 46 treesize of output 21 [2022-11-21 17:21:48,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-21 17:21:49,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:49,063 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 57 treesize of output 53 [2022-11-21 17:21:49,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:49,091 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:21:49,091 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 52 treesize of output 50 [2022-11-21 17:21:49,116 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:21:49,116 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-21 17:21:51,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:21:51,107 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-21 17:21:51,108 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 98 treesize of output 50 [2022-11-21 17:21:51,135 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:21:51,135 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 88 treesize of output 83 [2022-11-21 17:21:51,531 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-21 17:21:51,532 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 126 treesize of output 89 [2022-11-21 17:21:51,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:21:51,546 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 94 treesize of output 86 [2022-11-21 17:21:51,562 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 35 treesize of output 29 [2022-11-21 17:21:51,973 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 122 treesize of output 90 [2022-11-21 17:21:53,524 INFO L321 Elim1Store]: treesize reduction 20, result has 71.0 percent of original size [2022-11-21 17:21:53,524 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 105 [2022-11-21 17:21:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:21:54,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:21:54,452 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (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 |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-21 17:21:54,474 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (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 |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-21 17:21:54,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (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 |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-21 17:21:54,555 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (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 |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-21 17:21:54,588 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-21 17:21:54,603 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-21 17:21:54,633 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-21 17:21:54,804 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| Int) (v_ArrVal_3975 (Array Int Int)) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3976 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| |c_#StackHeapBarrier|)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3975)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3976))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store .cse2 .cse3 v_ArrVal_3964) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-21 17:21:54,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193972487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:21:54,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:21:54,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 66 [2022-11-21 17:21:54,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601227329] [2022-11-21 17:21:54,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:21:54,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-21 17:21:54,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:21:54,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-21 17:21:54,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=4094, Unknown=10, NotChecked=1080, Total=5402 [2022-11-21 17:21:54,811 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 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-21 17:21:59,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 17:22:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:22:10,578 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-11-21 17:22:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-21 17:22:10,579 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 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-21 17:22:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:22:10,580 INFO L225 Difference]: With dead ends: 164 [2022-11-21 17:22:10,580 INFO L226 Difference]: Without dead ends: 164 [2022-11-21 17:22:10,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1651 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=684, Invalid=7893, Unknown=11, NotChecked=1512, Total=10100 [2022-11-21 17:22:10,582 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1188 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 2148 mSolverCounterSat, 38 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2148 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:22:10,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1334 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2148 Invalid, 8 Unknown, 0 Unchecked, 6.1s Time] [2022-11-21 17:22:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-21 17:22:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 89. [2022-11-21 17:22:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 84 states have internal predecessors, (89), 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-21 17:22:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-21 17:22:10,587 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 63 [2022-11-21 17:22:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:22:10,587 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-21 17:22:10,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 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-21 17:22:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-21 17:22:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-21 17:22:10,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:22:10,589 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:22:10,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:10,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-21 17:22:10,796 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:22:10,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1095322986, now seen corresponding path program 1 times [2022-11-21 17:22:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:10,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193904344] [2022-11-21 17:22:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:10,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:22:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:16,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:22:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:17,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:22:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:22:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:18,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193904344] [2022-11-21 17:22:18,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193904344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:22:18,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081029249] [2022-11-21 17:22:18,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:18,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:22:18,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:18,820 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:22:18,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-21 17:22:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:19,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 203 conjunts are in the unsatisfiable core [2022-11-21 17:22:19,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:19,266 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-21 17:22:19,282 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-21 17:22:19,459 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-21 17:22:19,464 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-21 17:22:19,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:22:20,329 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:22:20,330 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-21 17:22:20,352 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-21 17:22:20,901 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-21 17:22:20,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2022-11-21 17:22:20,915 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-21 17:22:22,006 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:22:22,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 17:22:22,019 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-21 17:22:22,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:22,062 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-21 17:22:22,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:22,097 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:22:22,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-21 17:22:22,672 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-21 17:22:22,712 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-21 17:22:22,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:22:23,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:22:23,442 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 76 treesize of output 67 [2022-11-21 17:22:23,460 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 18 treesize of output 20 [2022-11-21 17:22:23,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-21 17:22:24,512 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:22:24,512 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 84 treesize of output 39 [2022-11-21 17:22:24,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:24,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-21 17:22:24,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-21 17:22:24,543 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-21 17:22:24,552 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-21 17:22:25,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:25,809 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-21 17:22:25,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:25,860 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:22:25,860 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 92 treesize of output 74 [2022-11-21 17:22:25,909 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 17:22:25,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-21 17:22:25,927 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-21 17:22:25,969 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 17:22:25,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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-21 17:22:25,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:25,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:25,992 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 25 treesize of output 30 [2022-11-21 17:22:28,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:28,987 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-21 17:22:30,316 INFO L321 Elim1Store]: treesize reduction 151, result has 10.7 percent of original size [2022-11-21 17:22:30,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 231 treesize of output 105 [2022-11-21 17:22:30,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:30,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2022-11-21 17:22:30,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:30,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2022-11-21 17:22:30,916 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-21 17:22:30,916 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 223 treesize of output 160 [2022-11-21 17:22:30,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:30,963 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:22:30,963 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 176 treesize of output 144 [2022-11-21 17:22:30,980 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 46 treesize of output 48 [2022-11-21 17:22:32,383 INFO L321 Elim1Store]: treesize reduction 48, result has 20.0 percent of original size [2022-11-21 17:22:32,383 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 75 [2022-11-21 17:22:32,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:32,408 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 17:22:32,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-21 17:22:32,876 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-21 17:22:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:33,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:22:34,189 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4186 (Array Int Int)) (v_ArrVal_4187 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4185)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4187))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4186) (select (select .cse0 .cse1) .cse2)) (+ 4 (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-11-21 17:22:34,214 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4183 Int) (v_ArrVal_4186 (Array Int Int)) (v_ArrVal_4187 (Array Int Int)) (v_ArrVal_4182 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4182) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4185)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4187))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_4183)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4186) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2022-11-21 17:22:38,811 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4183 Int) (v_ArrVal_4186 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| Int) (v_ArrVal_4187 (Array Int Int)) (v_ArrVal_4199 (Array Int Int)) (v_ArrVal_4201 (Array Int Int)) (v_ArrVal_4202 (Array Int Int)) (v_ArrVal_4200 Int) (v_ArrVal_4182 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4201)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4202))) (let ((.cse11 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse10 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse7 .cse11) .cse10))) (let ((.cse8 (select .cse7 .cse1)) (.cse2 (select (select .cse9 .cse11) .cse10))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store .cse9 .cse1 v_ArrVal_4182) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4185)) (.cse3 (store (store .cse7 .cse1 (store .cse8 .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4187))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4199))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4183))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4186) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) (not (<= (+ .cse2 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4200) .cse1))) (not (<= 0 .cse10)) (not (<= 0 .cse2)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select .cse8 .cse2) .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47|) 0)))))))) is different from false [2022-11-21 17:22:38,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081029249] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:22:38,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:22:38,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 79 [2022-11-21 17:22:38,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691133375] [2022-11-21 17:22:38,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:22:38,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-21 17:22:38,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:38,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-21 17:22:38,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8207, Unknown=14, NotChecked=552, Total=9120 [2022-11-21 17:22:38,819 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 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-21 17:23:01,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:01,676 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-11-21 17:23:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-21 17:23:01,677 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 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 64 [2022-11-21 17:23:01,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:01,678 INFO L225 Difference]: With dead ends: 108 [2022-11-21 17:23:01,678 INFO L226 Difference]: Without dead ends: 108 [2022-11-21 17:23:01,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3037 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=1015, Invalid=13986, Unknown=17, NotChecked=732, Total=15750 [2022-11-21 17:23:01,679 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 636 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 3223 mSolverCounterSat, 45 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3223 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:01,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1156 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3223 Invalid, 4 Unknown, 0 Unchecked, 6.7s Time] [2022-11-21 17:23:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-21 17:23:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2022-11-21 17:23:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 84 states have internal predecessors, (88), 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-21 17:23:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-11-21 17:23:01,683 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 64 [2022-11-21 17:23:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:01,684 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-11-21 17:23:01,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 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-21 17:23:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-11-21 17:23:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 17:23:01,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:01,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:01,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-21 17:23:01,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-21 17:23:01,891 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:23:01,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:01,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826698, now seen corresponding path program 2 times [2022-11-21 17:23:01,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:01,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723832497] [2022-11-21 17:23:01,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:01,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:23:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:23:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:06,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:23:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:23:07,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:07,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723832497] [2022-11-21 17:23:07,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723832497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:23:07,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343299427] [2022-11-21 17:23:07,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:23:07,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:23:07,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:23:07,616 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:23:07,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-21 17:23:08,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:23:08,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:23:08,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 188 conjunts are in the unsatisfiable core [2022-11-21 17:23:08,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:23:08,111 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-21 17:23:08,250 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-21 17:23:08,365 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-21 17:23:08,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:08,791 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-21 17:23:09,198 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-21 17:23:09,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:09,206 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-21 17:23:09,782 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:23:09,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:23:09,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:09,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:09,814 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 17 treesize of output 22 [2022-11-21 17:23:10,281 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-21 17:23:10,896 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:23:10,897 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 35 treesize of output 34 [2022-11-21 17:23:11,769 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:23:11,769 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-21 17:23:11,783 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-21 17:23:11,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:11,794 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-21 17:23:11,801 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-21 17:23:12,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:12,998 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-21 17:23:13,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:13,043 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:23:13,043 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 67 treesize of output 57 [2022-11-21 17:23:13,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:13,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:13,094 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-21 17:23:13,094 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 1 case distinctions, treesize of input 25 treesize of output 42 [2022-11-21 17:23:13,147 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:23:13,147 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-21 17:23:17,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:23:18,078 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2022-11-21 17:23:18,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 209 treesize of output 122 [2022-11-21 17:23:18,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:18,149 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-21 17:23:18,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 121 [2022-11-21 17:23:19,266 INFO L321 Elim1Store]: treesize reduction 88, result has 27.9 percent of original size [2022-11-21 17:23:19,266 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 427 treesize of output 160 [2022-11-21 17:23:19,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:19,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:23:19,306 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-11-21 17:23:19,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 147 [2022-11-21 17:23:24,268 INFO L321 Elim1Store]: treesize reduction 48, result has 72.9 percent of original size [2022-11-21 17:23:24,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 401 treesize of output 467 [2022-11-21 17:23:32,820 INFO L321 Elim1Store]: treesize reduction 172, result has 62.7 percent of original size [2022-11-21 17:23:32,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 362 treesize of output 482 [2022-11-21 17:23:33,460 INFO L321 Elim1Store]: treesize reduction 72, result has 69.6 percent of original size [2022-11-21 17:23:33,461 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 10 new quantified variables, introduced 21 case distinctions, treesize of input 318 treesize of output 355 [2022-11-21 17:23:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:51,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:23:58,088 INFO L321 Elim1Store]: treesize reduction 18, result has 98.3 percent of original size [2022-11-21 17:23:58,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 550 treesize of output 1082 [2022-11-21 17:24:05,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343299427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:24:05,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:24:05,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 42] total 78 [2022-11-21 17:24:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12638022] [2022-11-21 17:24:05,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:24:05,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-21 17:24:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:24:05,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-21 17:24:05,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=9299, Unknown=2, NotChecked=0, Total=9702 [2022-11-21 17:24:05,561 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 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-21 17:24:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:24:38,969 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2022-11-21 17:24:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-21 17:24:38,970 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 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 68 [2022-11-21 17:24:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:24:38,972 INFO L225 Difference]: With dead ends: 178 [2022-11-21 17:24:38,972 INFO L226 Difference]: Without dead ends: 178 [2022-11-21 17:24:38,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3797 ImplicationChecksByTransitivity, 52.2s TimeCoverageRelationStatistics Valid=1308, Invalid=16778, Unknown=4, NotChecked=0, Total=18090 [2022-11-21 17:24:38,975 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1720 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 3491 mSolverCounterSat, 43 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 3536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3491 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:24:38,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 1303 Invalid, 3536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3491 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2022-11-21 17:24:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-21 17:24:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 99. [2022-11-21 17:24:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3) internal successors, (104), 94 states have internal predecessors, (104), 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-21 17:24:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2022-11-21 17:24:38,981 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 68 [2022-11-21 17:24:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:24:38,981 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2022-11-21 17:24:38,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 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-21 17:24:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-11-21 17:24:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 17:24:38,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:24:38,983 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:24:38,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-21 17:24:39,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:24:39,192 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:24:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826697, now seen corresponding path program 2 times [2022-11-21 17:24:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:24:39,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211168371] [2022-11-21 17:24:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:24:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:24:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:44,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:24:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:44,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:24:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:24:45,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:24:45,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211168371] [2022-11-21 17:24:45,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211168371] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:24:45,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9255253] [2022-11-21 17:24:45,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:24:45,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:24:45,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:24:45,962 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:24:45,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-21 17:24:46,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:24:46,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:24:46,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-21 17:24:46,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:24:47,843 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-21 17:24:47,850 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-21 17:24:48,014 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-21 17:24:48,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:24:48,882 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 11 [2022-11-21 17:24:48,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:24:48,913 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 13 [2022-11-21 17:24:48,953 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:24:48,953 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-21 17:24:52,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:24:52,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:24:53,056 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-21 17:24:53,056 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 159 treesize of output 106 [2022-11-21 17:24:53,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:24:53,115 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-21 17:24:53,115 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 137 treesize of output 84 [2022-11-21 17:24:54,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:24:54,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:24:54,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:24:54,373 INFO L321 Elim1Store]: treesize reduction 156, result has 29.7 percent of original size [2022-11-21 17:24:54,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 124 treesize of output 143 [2022-11-21 17:24:54,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:24:54,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:24:54,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:24:54,676 INFO L321 Elim1Store]: treesize reduction 116, result has 46.5 percent of original size [2022-11-21 17:24:54,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 136 treesize of output 184 [2022-11-21 17:25:07,598 INFO L321 Elim1Store]: treesize reduction 303, result has 45.2 percent of original size [2022-11-21 17:25:07,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 21 new quantified variables, introduced 45 case distinctions, treesize of input 456 treesize of output 478 [2022-11-21 17:25:08,696 INFO L321 Elim1Store]: treesize reduction 264, result has 48.9 percent of original size [2022-11-21 17:25:08,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 477 treesize of output 544 [2022-11-21 17:25:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:25:58,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:26:12,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:12,435 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 14128 treesize of output 14132 [2022-11-21 17:26:25,836 WARN L859 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse0 (select (select .cse14 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse3 (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select .cse12 .cse3) .cse0)) (.cse2 (select (select .cse14 .cse3) .cse0))) (let ((.cse9 (let ((.cse13 (store .cse14 .cse4 (store (select .cse14 .cse4) .cse2 0)))) (store .cse13 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse13 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse13 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse10 (let ((.cse11 (store .cse12 .cse4 (store (select .cse12 .cse4) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse11 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse11 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse11 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse10 .cse7) .cse1)) (.cse6 (select (select .cse9 .cse7) .cse1))) (let ((.cse8 (select (select .cse10 .cse5) .cse6))) (or (not (<= 0 .cse1)) (not (<= 0 .cse2)) (= .cse3 .cse4) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse5) (not (<= 0 .cse6)) (= .cse7 .cse8) (= .cse8 .cse5) (<= (select (select .cse9 .cse5) .cse6) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse15 (select (select .cse29 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse15)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse18 (select (select .cse27 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse19 (select (select .cse27 .cse18) .cse15)) (.cse17 (select (select .cse29 .cse18) .cse15))) (let ((.cse23 (let ((.cse28 (store .cse29 .cse19 (store (select .cse29 .cse19) .cse17 0)))) (store .cse28 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse28 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse28 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse24 (let ((.cse26 (store .cse27 .cse19 (store (select .cse27 .cse19) .cse17 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse26 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse26 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse26 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (select (select .cse24 .cse25) .cse16)) (.cse22 (select (select .cse23 .cse25) .cse16))) (let ((.cse20 (select (select .cse24 .cse21) .cse22))) (or (not (<= 0 .cse16)) (not (<= 0 .cse17)) (= .cse18 .cse19) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse20) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse21) (not (<= 0 .cse22)) (= .cse20 .cse21) (= (select (select .cse23 .cse21) .cse22) .cse16)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse30 (select (select .cse42 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse30)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse43 (select (select .cse39 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse40 (select (select .cse39 .cse43) .cse30)) (.cse31 (select (select .cse42 .cse43) .cse30))) (let ((.cse33 (let ((.cse41 (store .cse42 .cse40 (store (select .cse42 .cse40) .cse31 0)))) (store .cse41 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse41 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse41 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse36 (let ((.cse38 (store .cse39 .cse40 (store (select .cse39 .cse40) .cse31 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse38 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse38 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse38 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse35 (select (select .cse33 .cse37) .cse32)) (.cse34 (select (select .cse36 .cse37) .cse32))) (or (= .cse31 .cse30) (not (<= 0 .cse32)) (not (<= 0 .cse31)) (<= 0 (+ (select (select .cse33 .cse34) .cse35) 4)) (< 0 .cse35) (not (<= 0 .cse35)) (= (select (select .cse36 .cse34) .cse35) .cse34))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse45 (select (select .cse57 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse58 (select (select .cse54 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse55 (select (select .cse54 .cse58) .cse45)) (.cse44 (select (select .cse57 .cse58) .cse45))) (let ((.cse52 (let ((.cse56 (store .cse57 .cse55 (store (select .cse57 .cse55) .cse44 0)))) (store .cse56 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse56 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse56 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse51 (let ((.cse53 (store .cse54 .cse55 (store (select .cse54 .cse55) .cse44 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse53 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse53 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse53 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (select (select .cse52 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse48 (select (select .cse51 .cse50) .cse46)) (.cse49 (select (select .cse52 .cse50) .cse46))) (let ((.cse47 (select (select .cse51 .cse48) .cse49))) (or (= .cse44 .cse45) (not (<= 0 .cse46)) (not (<= 0 .cse44)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse47) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse48) (not (<= 0 .cse49)) (= .cse50 .cse47) (= .cse47 .cse48)))))))))) (not (<= 0 .cse45)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse60 (select (select .cse72 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse73 (select (select .cse69 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse70 (select (select .cse69 .cse73) .cse60)) (.cse59 (select (select .cse72 .cse73) .cse60))) (let ((.cse66 (let ((.cse71 (store .cse72 .cse70 (store (select .cse72 .cse70) .cse59 0)))) (store .cse71 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse71 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse71 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse67 (let ((.cse68 (store .cse69 .cse70 (store (select .cse69 .cse70) .cse59 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse68 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse68 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse68 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse64 (select (select .cse67 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse61 (select (select .cse66 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse62 (select (select .cse67 .cse64) .cse61)) (.cse63 (select (select .cse66 .cse64) .cse61))) (let ((.cse65 (select (select .cse67 .cse62) .cse63))) (or (= .cse59 .cse60) (not (<= 0 .cse61)) (not (<= 0 .cse59)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse62) (not (<= 0 .cse63)) (= .cse64 .cse65) (= .cse65 .cse62) (<= (select (select .cse66 .cse62) .cse63) 0)))))))))) (not (<= 0 .cse60)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse74 (select (select .cse87 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse74)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse77 (select (select .cse85 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse78 (select (select .cse85 .cse77) .cse74)) (.cse76 (select (select .cse87 .cse77) .cse74))) (let ((.cse79 (let ((.cse86 (store .cse87 .cse78 (store (select .cse87 .cse78) .cse76 0)))) (store .cse86 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse86 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse86 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse82 (let ((.cse84 (store .cse85 .cse78 (store (select .cse85 .cse78) .cse76 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse84 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse84 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse84 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse83 (select (select .cse82 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse75 (select (select .cse79 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse81 (select (select .cse79 .cse83) .cse75)) (.cse80 (select (select .cse82 .cse83) .cse75))) (or (not (<= 0 .cse75)) (not (<= 0 .cse76)) (= .cse77 .cse78) (<= 0 (+ (select (select .cse79 .cse80) .cse81) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse80) (not (<= 0 .cse81)) (= (select (select .cse82 .cse80) .cse81) .cse80))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse101 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse88 (select (select .cse101 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse88)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse91 (select (select .cse99 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse92 (select (select .cse99 .cse91) .cse88)) (.cse90 (select (select .cse101 .cse91) .cse88))) (let ((.cse97 (let ((.cse100 (store .cse101 .cse92 (store (select .cse101 .cse92) .cse90 0)))) (store .cse100 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse100 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse100 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse95 (let ((.cse98 (store .cse99 .cse92 (store (select .cse99 .cse92) .cse90 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse98 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse98 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse98 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse94 (select (select .cse95 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse89 (select (select .cse97 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse93 (select (select .cse97 .cse94) .cse89)) (.cse96 (select (select .cse95 .cse94) .cse89))) (or (not (<= 0 .cse89)) (not (<= 0 .cse90)) (= .cse91 .cse92) (not (<= 0 .cse93)) (not (<= .cse93 0)) (= .cse94 (select (select .cse95 .cse96) .cse93)) (<= (select (select .cse97 .cse96) .cse93) 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse96)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse115 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse102 (select (select .cse115 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse102)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse112 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse116 (select (select .cse112 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse113 (select (select .cse112 .cse116) .cse102)) (.cse103 (select (select .cse115 .cse116) .cse102))) (let ((.cse110 (let ((.cse114 (store .cse115 .cse113 (store (select .cse115 .cse113) .cse103 0)))) (store .cse114 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse114 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse114 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse109 (let ((.cse111 (store .cse112 .cse113 (store (select .cse112 .cse113) .cse103 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse111 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse111 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse111 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse107 (select (select .cse109 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse104 (select (select .cse110 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse108 (select (select .cse109 .cse107) .cse104)) (.cse105 (select (select .cse110 .cse107) .cse104))) (let ((.cse106 (select (select .cse109 .cse108) .cse105))) (or (= .cse103 .cse102) (not (<= 0 .cse104)) (not (<= 0 .cse103)) (< 0 .cse105) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse106) (not (<= 0 .cse105)) (= .cse107 .cse106) (= .cse106 .cse108)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse130 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse117 (select (select .cse130 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse117)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse127 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse131 (select (select .cse127 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse128 (select (select .cse127 .cse131) .cse117)) (.cse118 (select (select .cse130 .cse131) .cse117))) (let ((.cse124 (let ((.cse129 (store .cse130 .cse128 (store (select .cse130 .cse128) .cse118 0)))) (store .cse129 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse129 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse129 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse121 (let ((.cse126 (store .cse127 .cse128 (store (select .cse127 .cse128) .cse118 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse126 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse126 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (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 .cse121 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse119 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse122 (select (select .cse121 .cse125) .cse119)) (.cse120 (select (select .cse124 .cse125) .cse119))) (let ((.cse123 (select (select .cse124 .cse122) .cse120))) (or (= .cse118 .cse117) (not (<= 0 .cse119)) (not (<= 0 .cse118)) (< 0 .cse120) (not (<= 0 .cse120)) (= (select (select .cse121 .cse122) .cse120) .cse122) (<= .cse123 0) (= .cse123 .cse119)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse146 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse132 (select (select .cse146 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse132)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse135 (select (select .cse144 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse136 (select (select .cse144 .cse135) .cse132)) (.cse134 (select (select .cse146 .cse135) .cse132))) (let ((.cse142 (let ((.cse145 (store .cse146 .cse136 (store (select .cse146 .cse136) .cse134 0)))) (store .cse145 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse145 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse145 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse141 (let ((.cse143 (store .cse144 .cse136 (store (select .cse144 .cse136) .cse134 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse143 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse143 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse143 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse140 (select (select .cse141 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse133 (select (select .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse138 (select (select .cse141 .cse140) .cse133)) (.cse139 (select (select .cse142 .cse140) .cse133))) (let ((.cse137 (select (select .cse141 .cse138) .cse139))) (or (not (<= 0 .cse133)) (not (<= 0 .cse134)) (= .cse135 .cse136) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse137) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse138) (not (<= 0 .cse139)) (= .cse140 .cse137) (= .cse137 .cse138)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse160 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse147 (select (select .cse160 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse147)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse158 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse150 (select (select .cse158 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse151 (select (select .cse158 .cse150) .cse147)) (.cse149 (select (select .cse160 .cse150) .cse147))) (let ((.cse152 (let ((.cse159 (store .cse160 .cse151 (store (select .cse160 .cse151) .cse149 0)))) (store .cse159 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse159 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse159 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse156 (let ((.cse157 (store .cse158 .cse151 (store (select .cse158 .cse151) .cse149 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse157 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse157 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse157 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse155 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse148 (select (select .cse152 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse153 (select (select .cse156 .cse155) .cse148)) (.cse154 (select (select .cse152 .cse155) .cse148))) (or (not (<= 0 .cse148)) (not (<= 0 .cse149)) (= .cse150 .cse151) (<= 0 (+ (select (select .cse152 .cse153) .cse154) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse153) (not (<= 0 .cse154)) (= .cse155 (select (select .cse156 .cse153) .cse154)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse175 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse161 (select (select .cse175 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse161)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse173 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse164 (select (select .cse173 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse165 (select (select .cse173 .cse164) .cse161)) (.cse163 (select (select .cse175 .cse164) .cse161))) (let ((.cse170 (let ((.cse174 (store .cse175 .cse165 (store (select .cse175 .cse165) .cse163 0)))) (store .cse174 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse174 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse174 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse166 (let ((.cse172 (store .cse173 .cse165 (store (select .cse173 .cse165) .cse163 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse172 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse172 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse172 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse171 (select (select .cse166 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse162 (select (select .cse170 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse167 (select (select .cse166 .cse171) .cse162)) (.cse168 (select (select .cse170 .cse171) .cse162))) (let ((.cse169 (select (select .cse170 .cse167) .cse168))) (or (not (<= 0 .cse162)) (not (<= 0 .cse163)) (= .cse164 .cse165) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (select (select .cse166 .cse167) .cse168)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse167) (< .cse169 (+ .cse168 1)) (not (<= 0 .cse168)) (= .cse169 .cse162)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse189 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse176 (select (select .cse189 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse176)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse187 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse179 (select (select .cse187 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse180 (select (select .cse187 .cse179) .cse176)) (.cse178 (select (select .cse189 .cse179) .cse176))) (let ((.cse181 (let ((.cse188 (store .cse189 .cse180 (store (select .cse189 .cse180) .cse178 0)))) (store .cse188 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse188 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse188 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse184 (let ((.cse186 (store .cse187 .cse180 (store (select .cse187 .cse180) .cse178 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse186 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse186 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse186 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse185 (select (select .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse177 (select (select .cse181 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse183 (select (select .cse181 .cse185) .cse177)) (.cse182 (select (select .cse184 .cse185) .cse177))) (or (not (<= 0 .cse177)) (not (<= 0 .cse178)) (= .cse179 .cse180) (<= 0 (+ (select (select .cse181 .cse182) .cse183) 4)) (< 0 .cse183) (not (<= 0 .cse183)) (= (select (select .cse184 .cse182) .cse183) .cse182))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse204 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse190 (select (select .cse204 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse190)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse202 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse193 (select (select .cse202 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse194 (select (select .cse202 .cse193) .cse190)) (.cse192 (select (select .cse204 .cse193) .cse190))) (let ((.cse199 (let ((.cse203 (store .cse204 .cse194 (store (select .cse204 .cse194) .cse192 0)))) (store .cse203 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse203 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse203 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse200 (let ((.cse201 (store .cse202 .cse194 (store (select .cse202 .cse194) .cse192 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse201 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse201 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse201 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse196 (select (select .cse200 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse191 (select (select .cse199 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse198 (select (select .cse200 .cse196) .cse191)) (.cse195 (select (select .cse199 .cse196) .cse191))) (let ((.cse197 (select (select .cse200 .cse198) .cse195))) (or (not (<= 0 .cse191)) (not (<= 0 .cse192)) (= .cse193 .cse194) (< 0 .cse195) (not (<= 0 .cse195)) (= .cse196 .cse197) (= .cse197 .cse198) (<= (select (select .cse199 .cse198) .cse195) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse217 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse205 (select (select .cse217 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse205)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse214 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse218 (select (select .cse214 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse215 (select (select .cse214 .cse218) .cse205)) (.cse206 (select (select .cse217 .cse218) .cse205))) (let ((.cse208 (let ((.cse216 (store .cse217 .cse215 (store (select .cse217 .cse215) .cse206 0)))) (store .cse216 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse216 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse216 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse211 (let ((.cse213 (store .cse214 .cse215 (store (select .cse214 .cse215) .cse206 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse213 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse213 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse213 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse212 (select (select .cse211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse207 (select (select .cse208 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse210 (select (select .cse208 .cse212) .cse207)) (.cse209 (select (select .cse211 .cse212) .cse207))) (or (= .cse206 .cse205) (not (<= 0 .cse207)) (not (<= 0 .cse206)) (<= 0 (+ (select (select .cse208 .cse209) .cse210) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse209) (not (<= 0 .cse210)) (= (select (select .cse211 .cse209) .cse210) .cse209))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse231 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse219 (select (select .cse231 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse219)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse228 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse232 (select (select .cse228 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse229 (select (select .cse228 .cse232) .cse219)) (.cse220 (select (select .cse231 .cse232) .cse219))) (let ((.cse222 (let ((.cse230 (store .cse231 .cse229 (store (select .cse231 .cse229) .cse220 0)))) (store .cse230 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse230 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse230 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse226 (let ((.cse227 (store .cse228 .cse229 (store (select .cse228 .cse229) .cse220 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse227 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse227 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse227 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse225 (select (select .cse226 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse221 (select (select .cse222 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse223 (select (select .cse226 .cse225) .cse221)) (.cse224 (select (select .cse222 .cse225) .cse221))) (or (= .cse220 .cse219) (not (<= 0 .cse221)) (not (<= 0 .cse220)) (<= 0 (+ (select (select .cse222 .cse223) .cse224) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse223) (not (<= 0 .cse224)) (= .cse225 (select (select .cse226 .cse223) .cse224)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse246 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse247 (select (select .cse246 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse244 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse235 (select (select .cse244 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse236 (select (select .cse244 .cse235) .cse247)) (.cse234 (select (select .cse246 .cse235) .cse247))) (let ((.cse240 (let ((.cse245 (store .cse246 .cse236 (store (select .cse246 .cse236) .cse234 0)))) (store .cse245 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse245 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse245 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse242 (let ((.cse243 (store .cse244 .cse236 (store (select .cse244 .cse236) .cse234 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse243 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse243 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse243 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse241 (select (select .cse242 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse233 (select (select .cse240 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse239 (select (select .cse242 .cse241) .cse233)) (.cse237 (select (select .cse240 .cse241) .cse233))) (let ((.cse238 (select (select .cse240 .cse239) .cse237))) (or (not (<= 0 .cse233)) (not (<= 0 .cse234)) (= .cse235 .cse236) (not (<= 0 .cse237)) (not (<= .cse237 0)) (<= .cse238 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse239)) (= .cse238 .cse233)))))))))) (not (<= 0 .cse247)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse261 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse262 (select (select .cse261 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse259 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse250 (select (select .cse259 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse251 (select (select .cse259 .cse250) .cse262)) (.cse249 (select (select .cse261 .cse250) .cse262))) (let ((.cse252 (let ((.cse260 (store .cse261 .cse251 (store (select .cse261 .cse251) .cse249 0)))) (store .cse260 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse260 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse260 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse257 (let ((.cse258 (store .cse259 .cse251 (store (select .cse259 .cse251) .cse249 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse258 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse258 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse258 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse255 (select (select .cse257 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse248 (select (select .cse252 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse253 (select (select .cse257 .cse255) .cse248)) (.cse254 (select (select .cse252 .cse255) .cse248))) (let ((.cse256 (select (select .cse257 .cse253) .cse254))) (or (not (<= 0 .cse248)) (not (<= 0 .cse249)) (= .cse250 .cse251) (<= 0 (+ (select (select .cse252 .cse253) .cse254) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse253) (not (<= 0 .cse254)) (= .cse255 .cse256) (= .cse256 .cse253)))))))))) (not (<= 0 .cse262)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse275 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse263 (select (select .cse275 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse263)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse272 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse276 (select (select .cse272 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse273 (select (select .cse272 .cse276) .cse263)) (.cse264 (select (select .cse275 .cse276) .cse263))) (let ((.cse270 (let ((.cse274 (store .cse275 .cse273 (store (select .cse275 .cse273) .cse264 0)))) (store .cse274 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse274 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse274 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse268 (let ((.cse271 (store .cse272 .cse273 (store (select .cse272 .cse273) .cse264 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse271 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse271 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse271 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse267 (select (select .cse268 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse265 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse266 (select (select .cse270 .cse267) .cse265)) (.cse269 (select (select .cse268 .cse267) .cse265))) (or (= .cse264 .cse263) (not (<= 0 .cse265)) (not (<= 0 .cse264)) (not (<= 0 .cse266)) (not (<= .cse266 0)) (= .cse267 (select (select .cse268 .cse269) .cse266)) (<= (select (select .cse270 .cse269) .cse266) 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse269)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse290 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse277 (select (select .cse290 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse277)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse287 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse291 (select (select .cse287 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse288 (select (select .cse287 .cse291) .cse277)) (.cse278 (select (select .cse290 .cse291) .cse277))) (let ((.cse283 (let ((.cse289 (store .cse290 .cse288 (store (select .cse290 .cse288) .cse278 0)))) (store .cse289 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse289 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse289 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse284 (let ((.cse286 (store .cse287 .cse288 (store (select .cse287 .cse288) .cse278 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse286 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse286 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse286 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse285 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse279 (select (select .cse283 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse281 (select (select .cse284 .cse285) .cse279)) (.cse282 (select (select .cse283 .cse285) .cse279))) (let ((.cse280 (select (select .cse284 .cse281) .cse282))) (or (= .cse278 .cse277) (not (<= 0 .cse279)) (not (<= 0 .cse278)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse280) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse281) (not (<= 0 .cse282)) (= .cse280 .cse281) (= (select (select .cse283 .cse281) .cse282) .cse279)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse305 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse293 (select (select .cse305 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse302 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse306 (select (select .cse302 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse303 (select (select .cse302 .cse306) .cse293)) (.cse292 (select (select .cse305 .cse306) .cse293))) (let ((.cse299 (let ((.cse304 (store .cse305 .cse303 (store (select .cse305 .cse303) .cse292 0)))) (store .cse304 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse304 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse304 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse300 (let ((.cse301 (store .cse302 .cse303 (store (select .cse302 .cse303) .cse292 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse301 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse301 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse301 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse296 (select (select .cse300 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse294 (select (select .cse299 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse298 (select (select .cse300 .cse296) .cse294)) (.cse295 (select (select .cse299 .cse296) .cse294))) (let ((.cse297 (select (select .cse300 .cse298) .cse295))) (or (= .cse292 .cse293) (not (<= 0 .cse294)) (not (<= 0 .cse292)) (< 0 .cse295) (not (<= 0 .cse295)) (= .cse296 .cse297) (= .cse297 .cse298) (<= (select (select .cse299 .cse298) .cse295) 0)))))))))) (not (<= 0 .cse293)))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse320 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse307 (select (select .cse320 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse307)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse317 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse321 (select (select .cse317 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse318 (select (select .cse317 .cse321) .cse307)) (.cse308 (select (select .cse320 .cse321) .cse307))) (let ((.cse314 (let ((.cse319 (store .cse320 .cse318 (store (select .cse320 .cse318) .cse308 0)))) (store .cse319 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse319 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse319 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse310 (let ((.cse316 (store .cse317 .cse318 (store (select .cse317 .cse318) .cse308 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse316 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse316 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse316 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse315 (select (select .cse310 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse309 (select (select .cse314 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse311 (select (select .cse310 .cse315) .cse309)) (.cse312 (select (select .cse314 .cse315) .cse309))) (let ((.cse313 (select (select .cse314 .cse311) .cse312))) (or (= .cse308 .cse307) (not (<= 0 .cse309)) (not (<= 0 .cse308)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (select (select .cse310 .cse311) .cse312)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse311) (< .cse313 (+ .cse312 1)) (not (<= 0 .cse312)) (= .cse313 .cse309)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse334 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse323 (select (select .cse334 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse331 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse335 (select (select .cse331 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse332 (select (select .cse331 .cse335) .cse323)) (.cse322 (select (select .cse334 .cse335) .cse323))) (let ((.cse325 (let ((.cse333 (store .cse334 .cse332 (store (select .cse334 .cse332) .cse322 0)))) (store .cse333 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse333 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse333 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse329 (let ((.cse330 (store .cse331 .cse332 (store (select .cse331 .cse332) .cse322 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse330 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse330 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse330 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse328 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse324 (select (select .cse325 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse326 (select (select .cse329 .cse328) .cse324)) (.cse327 (select (select .cse325 .cse328) .cse324))) (or (= .cse322 .cse323) (not (<= 0 .cse324)) (not (<= 0 .cse322)) (<= 0 (+ (select (select .cse325 .cse326) .cse327) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse326) (not (<= 0 .cse327)))))))))) (not (<= 0 .cse323)))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse350 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse336 (select (select .cse350 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse336)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse348 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse339 (select (select .cse348 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse340 (select (select .cse348 .cse339) .cse336)) (.cse338 (select (select .cse350 .cse339) .cse336))) (let ((.cse344 (let ((.cse349 (store .cse350 .cse340 (store (select .cse350 .cse340) .cse338 0)))) (store .cse349 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse349 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse349 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse345 (let ((.cse347 (store .cse348 .cse340 (store (select .cse348 .cse340) .cse338 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse347 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse347 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse347 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse346 (select (select .cse345 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse337 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse343 (select (select .cse345 .cse346) .cse337)) (.cse341 (select (select .cse344 .cse346) .cse337))) (let ((.cse342 (select (select .cse345 .cse343) .cse341))) (or (not (<= 0 .cse337)) (not (<= 0 .cse338)) (= .cse339 .cse340) (< 0 .cse341) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse342) (not (<= 0 .cse341)) (= .cse342 .cse343) (= (select (select .cse344 .cse343) .cse341) .cse337)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse364 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse351 (select (select .cse364 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse351)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse361 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse365 (select (select .cse361 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse362 (select (select .cse361 .cse365) .cse351)) (.cse352 (select (select .cse364 .cse365) .cse351))) (let ((.cse354 (let ((.cse363 (store .cse364 .cse362 (store (select .cse364 .cse362) .cse352 0)))) (store .cse363 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse363 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse363 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse359 (let ((.cse360 (store .cse361 .cse362 (store (select .cse361 .cse362) .cse352 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse360 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse360 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse360 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse357 (select (select .cse359 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse353 (select (select .cse354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse355 (select (select .cse359 .cse357) .cse353)) (.cse356 (select (select .cse354 .cse357) .cse353))) (let ((.cse358 (select (select .cse359 .cse355) .cse356))) (or (= .cse352 .cse351) (not (<= 0 .cse353)) (not (<= 0 .cse352)) (<= 0 (+ (select (select .cse354 .cse355) .cse356) 4)) (< 0 .cse356) (not (<= 0 .cse356)) (= .cse357 .cse358) (= .cse358 .cse355)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse380 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse366 (select (select .cse380 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse366)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse378 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse369 (select (select .cse378 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse370 (select (select .cse378 .cse369) .cse366)) (.cse368 (select (select .cse380 .cse369) .cse366))) (let ((.cse371 (let ((.cse379 (store .cse380 .cse370 (store (select .cse380 .cse370) .cse368 0)))) (store .cse379 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse379 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse379 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse376 (let ((.cse377 (store .cse378 .cse370 (store (select .cse378 .cse370) .cse368 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse377 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse377 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse377 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse374 (select (select .cse376 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse367 (select (select .cse371 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse372 (select (select .cse376 .cse374) .cse367)) (.cse373 (select (select .cse371 .cse374) .cse367))) (let ((.cse375 (select (select .cse376 .cse372) .cse373))) (or (not (<= 0 .cse367)) (not (<= 0 .cse368)) (= .cse369 .cse370) (<= 0 (+ (select (select .cse371 .cse372) .cse373) 4)) (< 0 .cse373) (not (<= 0 .cse373)) (= .cse374 .cse375) (= .cse375 .cse372)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse394 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse381 (select (select .cse394 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse381)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse391 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse395 (select (select .cse391 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse392 (select (select .cse391 .cse395) .cse381)) (.cse382 (select (select .cse394 .cse395) .cse381))) (let ((.cse387 (let ((.cse393 (store .cse394 .cse392 (store (select .cse394 .cse392) .cse382 0)))) (store .cse393 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse393 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse393 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse388 (let ((.cse390 (store .cse391 .cse392 (store (select .cse391 .cse392) .cse382 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse390 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse390 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse390 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse389 (select (select .cse388 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse383 (select (select .cse387 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse386 (select (select .cse388 .cse389) .cse383)) (.cse384 (select (select .cse387 .cse389) .cse383))) (let ((.cse385 (select (select .cse388 .cse386) .cse384))) (or (= .cse382 .cse381) (not (<= 0 .cse383)) (not (<= 0 .cse382)) (< 0 .cse384) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse385) (not (<= 0 .cse384)) (= .cse385 .cse386) (= (select (select .cse387 .cse386) .cse384) .cse383)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse409 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse396 (select (select .cse409 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse396)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse406 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse410 (select (select .cse406 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse407 (select (select .cse406 .cse410) .cse396)) (.cse397 (select (select .cse409 .cse410) .cse396))) (let ((.cse399 (let ((.cse408 (store .cse409 .cse407 (store (select .cse409 .cse407) .cse397 0)))) (store .cse408 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse408 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse408 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse404 (let ((.cse405 (store .cse406 .cse407 (store (select .cse406 .cse407) .cse397 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse405 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse405 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse405 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse402 (select (select .cse404 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse398 (select (select .cse399 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse400 (select (select .cse404 .cse402) .cse398)) (.cse401 (select (select .cse399 .cse402) .cse398))) (let ((.cse403 (select (select .cse404 .cse400) .cse401))) (or (= .cse397 .cse396) (not (<= 0 .cse398)) (not (<= 0 .cse397)) (<= 0 (+ (select (select .cse399 .cse400) .cse401) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse400) (not (<= 0 .cse401)) (= .cse402 .cse403) (= .cse403 .cse400)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse424 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse425 (select (select .cse424 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse422 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse413 (select (select .cse422 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse414 (select (select .cse422 .cse413) .cse425)) (.cse412 (select (select .cse424 .cse413) .cse425))) (let ((.cse417 (let ((.cse423 (store .cse424 .cse414 (store (select .cse424 .cse414) .cse412 0)))) (store .cse423 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse423 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse423 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse420 (let ((.cse421 (store .cse422 .cse414 (store (select .cse422 .cse414) .cse412 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse421 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse421 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse421 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse419 (select (select .cse420 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse411 (select (select .cse417 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse416 (select (select .cse420 .cse419) .cse411)) (.cse418 (select (select .cse417 .cse419) .cse411))) (let ((.cse415 (select (select .cse420 .cse416) .cse418))) (or (not (<= 0 .cse411)) (not (<= 0 .cse412)) (= .cse413 .cse414) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse415) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse416) (< (select (select .cse417 .cse416) .cse418) (+ .cse418 1)) (not (<= 0 .cse418)) (= .cse419 .cse415)))))))))) (not (<= 0 .cse425)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse439 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse426 (select (select .cse439 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse426)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse436 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse440 (select (select .cse436 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse437 (select (select .cse436 .cse440) .cse426)) (.cse427 (select (select .cse439 .cse440) .cse426))) (let ((.cse433 (let ((.cse438 (store .cse439 .cse437 (store (select .cse439 .cse437) .cse427 0)))) (store .cse438 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse438 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse438 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse431 (let ((.cse435 (store .cse436 .cse437 (store (select .cse436 .cse437) .cse427 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse435 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse435 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse435 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse434 (select (select .cse431 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse428 (select (select .cse433 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse429 (select (select .cse431 .cse434) .cse428)) (.cse430 (select (select .cse433 .cse434) .cse428))) (let ((.cse432 (select (select .cse433 .cse429) .cse430))) (or (= .cse427 .cse426) (not (<= 0 .cse428)) (not (<= 0 .cse427)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse429) (not (<= 0 .cse430)) (= (select (select .cse431 .cse429) .cse430) .cse429) (<= .cse432 0) (= .cse432 .cse428)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse455 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse441 (select (select .cse455 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse441)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse453 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse444 (select (select .cse453 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse445 (select (select .cse453 .cse444) .cse441)) (.cse443 (select (select .cse455 .cse444) .cse441))) (let ((.cse450 (let ((.cse454 (store .cse455 .cse445 (store (select .cse455 .cse445) .cse443 0)))) (store .cse454 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse454 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse454 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse447 (let ((.cse452 (store .cse453 .cse445 (store (select .cse453 .cse445) .cse443 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse452 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse452 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse452 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse451 (select (select .cse447 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse442 (select (select .cse450 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse448 (select (select .cse447 .cse451) .cse442)) (.cse446 (select (select .cse450 .cse451) .cse442))) (let ((.cse449 (select (select .cse450 .cse448) .cse446))) (or (not (<= 0 .cse442)) (not (<= 0 .cse443)) (= .cse444 .cse445) (< 0 .cse446) (not (<= 0 .cse446)) (= (select (select .cse447 .cse448) .cse446) .cse448) (<= .cse449 0) (= .cse449 .cse442)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse470 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse456 (select (select .cse470 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse456)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse468 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse459 (select (select .cse468 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse460 (select (select .cse468 .cse459) .cse456)) (.cse458 (select (select .cse470 .cse459) .cse456))) (let ((.cse466 (let ((.cse469 (store .cse470 .cse460 (store (select .cse470 .cse460) .cse458 0)))) (store .cse469 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse469 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse469 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse465 (let ((.cse467 (store .cse468 .cse460 (store (select .cse468 .cse460) .cse458 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse467 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse467 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse467 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse463 (select (select .cse465 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse457 (select (select .cse466 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse464 (select (select .cse465 .cse463) .cse457)) (.cse461 (select (select .cse466 .cse463) .cse457))) (let ((.cse462 (select (select .cse465 .cse464) .cse461))) (or (not (<= 0 .cse457)) (not (<= 0 .cse458)) (= .cse459 .cse460) (< 0 .cse461) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse462) (not (<= 0 .cse461)) (= .cse463 .cse462) (= .cse462 .cse464)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse485 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse471 (select (select .cse485 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse471)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse483 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse474 (select (select .cse483 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse475 (select (select .cse483 .cse474) .cse471)) (.cse473 (select (select .cse485 .cse474) .cse471))) (let ((.cse480 (let ((.cse484 (store .cse485 .cse475 (store (select .cse485 .cse475) .cse473 0)))) (store .cse484 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse484 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse484 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse478 (let ((.cse482 (store .cse483 .cse475 (store (select .cse483 .cse475) .cse473 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse482 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse482 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse482 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse481 (select (select .cse478 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse472 (select (select .cse480 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse476 (select (select .cse478 .cse481) .cse472)) (.cse477 (select (select .cse480 .cse481) .cse472))) (let ((.cse479 (select (select .cse480 .cse476) .cse477))) (or (not (<= 0 .cse472)) (not (<= 0 .cse473)) (= .cse474 .cse475) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse476) (not (<= 0 .cse477)) (= (select (select .cse478 .cse476) .cse477) .cse476) (<= .cse479 0) (= .cse479 .cse472)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse499 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse486 (select (select .cse499 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse486)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse496 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse500 (select (select .cse496 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse497 (select (select .cse496 .cse500) .cse486)) (.cse487 (select (select .cse499 .cse500) .cse486))) (let ((.cse492 (let ((.cse498 (store .cse499 .cse497 (store (select .cse499 .cse497) .cse487 0)))) (store .cse498 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse498 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse498 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse494 (let ((.cse495 (store .cse496 .cse497 (store (select .cse496 .cse497) .cse487 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse495 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse495 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse495 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse493 (select (select .cse494 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse488 (select (select .cse492 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse491 (select (select .cse494 .cse493) .cse488)) (.cse489 (select (select .cse492 .cse493) .cse488))) (let ((.cse490 (select (select .cse492 .cse491) .cse489))) (or (= .cse487 .cse486) (not (<= 0 .cse488)) (not (<= 0 .cse487)) (not (<= 0 .cse489)) (not (<= .cse489 0)) (<= .cse490 0) (not (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse491)) (= .cse490 .cse488)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse514 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse501 (select (select .cse514 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse501)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse511 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse515 (select (select .cse511 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse512 (select (select .cse511 .cse515) .cse501)) (.cse502 (select (select .cse514 .cse515) .cse501))) (let ((.cse506 (let ((.cse513 (store .cse514 .cse512 (store (select .cse514 .cse512) .cse502 0)))) (store .cse513 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse513 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse513 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse509 (let ((.cse510 (store .cse511 .cse512 (store (select .cse511 .cse512) .cse502 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse510 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse510 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse510 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse508 (select (select .cse509 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse503 (select (select .cse506 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse505 (select (select .cse509 .cse508) .cse503)) (.cse507 (select (select .cse506 .cse508) .cse503))) (let ((.cse504 (select (select .cse509 .cse505) .cse507))) (or (= .cse502 .cse501) (not (<= 0 .cse503)) (not (<= 0 .cse502)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse504) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse505) (< (select (select .cse506 .cse505) .cse507) (+ .cse507 1)) (not (<= 0 .cse507)) (= .cse508 .cse504)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0)) (forall ((v_ArrVal_4610 (Array Int Int))) (let ((.cse529 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4610))) (let ((.cse516 (select (select .cse529 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse516)) (forall ((v_ArrVal_4611 (Array Int Int))) (let ((.cse527 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| v_ArrVal_4611))) (let ((.cse519 (select (select .cse527 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse520 (select (select .cse527 .cse519) .cse516)) (.cse518 (select (select .cse529 .cse519) .cse516))) (let ((.cse521 (let ((.cse528 (store .cse529 .cse520 (store (select .cse529 .cse520) .cse518 0)))) (store .cse528 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse528 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse528 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse525 (let ((.cse526 (store .cse527 .cse520 (store (select .cse527 .cse520) .cse518 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|)))) (store .cse526 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| (store (select .cse526 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53|) 0 (select (select .cse526 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse524 (select (select .cse525 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse517 (select (select .cse521 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse522 (select (select .cse525 .cse524) .cse517)) (.cse523 (select (select .cse521 .cse524) .cse517))) (or (not (<= 0 .cse517)) (not (<= 0 .cse518)) (= .cse519 .cse520) (<= 0 (+ (select (select .cse521 .cse522) .cse523) 4)) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_53| .cse522) (not (<= 0 .cse523))))))))))))))))) (not (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) is different from true [2022-11-21 17:26:25,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9255253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:26:25,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:26:25,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39] total 77 [2022-11-21 17:26:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694040332] [2022-11-21 17:26:25,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:26:25,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-21 17:26:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:25,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-21 17:26:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=10032, Unknown=1, NotChecked=202, Total=10712 [2022-11-21 17:26:25,854 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 78 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 71 states have internal predecessors, (120), 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-21 17:27:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:27:01,037 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2022-11-21 17:27:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-21 17:27:01,037 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 71 states have internal predecessors, (120), 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 68 [2022-11-21 17:27:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:27:01,039 INFO L225 Difference]: With dead ends: 165 [2022-11-21 17:27:01,039 INFO L226 Difference]: Without dead ends: 165 [2022-11-21 17:27:01,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4176 ImplicationChecksByTransitivity, 55.7s TimeCoverageRelationStatistics Valid=1469, Invalid=18556, Unknown=1, NotChecked=280, Total=20306 [2022-11-21 17:27:01,041 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1969 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 3222 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1969 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:27:01,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1969 Valid, 1363 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3222 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-11-21 17:27:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-21 17:27:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 99. [2022-11-21 17:27:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.275) internal successors, (102), 94 states have internal predecessors, (102), 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-21 17:27:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-21 17:27:01,046 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 68 [2022-11-21 17:27:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:27:01,046 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-21 17:27:01,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 71 states have internal predecessors, (120), 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-21 17:27:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-21 17:27:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 17:27:01,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:27:01,048 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:27:01,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-21 17:27:01,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:27:01,256 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:27:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:27:01,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1057077042, now seen corresponding path program 1 times [2022-11-21 17:27:01,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:27:01,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820436725] [2022-11-21 17:27:01,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:27:01,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:27:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:27:05,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:27:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:27:05,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:27:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:27:05,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:27:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:27:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:27:06,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:27:06,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820436725] [2022-11-21 17:27:06,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820436725] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:27:06,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127197570] [2022-11-21 17:27:06,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:27:06,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:27:06,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:27:06,970 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:27:06,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-21 17:27:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:27:07,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-21 17:27:07,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:27:07,384 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-21 17:27:07,583 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-21 17:27:08,269 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:27:08,270 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-21 17:27:08,812 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-21 17:27:09,053 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:27:09,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:27:09,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:27:10,225 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:27:10,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:27:11,126 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-21 17:27:11,126 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 71 treesize of output 26 [2022-11-21 17:27:12,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:12,303 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-21 17:27:12,304 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 79 treesize of output 62 [2022-11-21 17:27:12,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:12,317 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 62 treesize of output 53 [2022-11-21 17:27:12,382 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-21 17:27:12,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-21 17:27:15,052 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-21 17:27:15,052 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 69 [2022-11-21 17:27:15,114 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:27:15,115 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 102 treesize of output 100 [2022-11-21 17:27:15,604 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-21 17:27:15,604 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 226 treesize of output 153 [2022-11-21 17:27:15,663 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:27:15,664 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 184 treesize of output 154 [2022-11-21 17:27:17,005 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 180 treesize of output 107 [2022-11-21 17:27:18,717 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-21 17:27:18,717 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 120 treesize of output 38 [2022-11-21 17:27:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:27:18,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:27:18,826 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2022-11-21 17:27:20,476 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2)))))))))) is different from false [2022-11-21 17:27:20,530 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2)))))))))) is different from false [2022-11-21 17:27:20,556 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2022-11-21 17:27:20,603 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4800) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2022-11-21 17:27:20,829 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| Int) (v_ArrVal_4810 (Array Int Int)) (v_ArrVal_4811 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_ArrVal_4802 (Array Int Int)) (v_ArrVal_4803 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56|) 0)) (not (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4810)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4811))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse8 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse5 (select (select .cse6 .cse7) .cse8))) (let ((.cse1 (store (store .cse6 .cse5 (store (select .cse6 .cse5) (select (select .cse4 .cse7) .cse8) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4802))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store .cse4 .cse5 v_ArrVal_4800) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| v_ArrVal_4803))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_56| |c_#StackHeapBarrier|)))) is different from false [2022-11-21 17:27:20,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127197570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:27:20,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:27:20,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 68 [2022-11-21 17:27:20,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134289813] [2022-11-21 17:27:20,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:27:20,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-21 17:27:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:27:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-21 17:27:20,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4538, Unknown=107, NotChecked=846, Total=5700 [2022-11-21 17:27:20,837 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 68 states, 64 states have (on average 1.84375) internal successors, (118), 59 states have internal predecessors, (118), 6 states have call successors, (6), 3 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-21 17:27:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:27:37,732 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-11-21 17:27:37,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-21 17:27:37,733 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 64 states have (on average 1.84375) internal successors, (118), 59 states have internal predecessors, (118), 6 states have call successors, (6), 3 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 69 [2022-11-21 17:27:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:27:37,734 INFO L225 Difference]: With dead ends: 119 [2022-11-21 17:27:37,734 INFO L226 Difference]: Without dead ends: 119 [2022-11-21 17:27:37,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1772 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=668, Invalid=8358, Unknown=118, NotChecked=1158, Total=10302 [2022-11-21 17:27:37,735 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 864 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 2507 mSolverCounterSat, 38 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2507 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:27:37,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1462 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2507 Invalid, 37 Unknown, 0 Unchecked, 6.4s Time] [2022-11-21 17:27:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-21 17:27:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2022-11-21 17:27:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.2625) internal successors, (101), 94 states have internal predecessors, (101), 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-21 17:27:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-11-21 17:27:37,739 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 69 [2022-11-21 17:27:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:27:37,740 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-11-21 17:27:37,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 64 states have (on average 1.84375) internal successors, (118), 59 states have internal predecessors, (118), 6 states have call successors, (6), 3 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-21 17:27:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-11-21 17:27:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-21 17:27:37,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:27:37,741 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:27:37,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-21 17:27:37,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:27:37,947 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:27:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:27:37,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1590317415, now seen corresponding path program 2 times [2022-11-21 17:27:37,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:27:37,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760873756] [2022-11-21 17:27:37,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:27:37,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:27:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:27:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:27:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:27:44,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:27:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:27:45,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:27:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:27:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:27:47,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:27:47,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760873756] [2022-11-21 17:27:47,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760873756] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:27:47,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978502656] [2022-11-21 17:27:47,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:27:47,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:27:47,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:27:47,036 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:27:47,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-21 17:27:47,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:27:47,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:27:47,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 213 conjunts are in the unsatisfiable core [2022-11-21 17:27:47,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:27:47,501 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-21 17:27:47,745 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-21 17:27:47,947 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-21 17:27:48,526 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:27:48,527 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-21 17:27:49,204 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 5 treesize of output 3 [2022-11-21 17:27:49,211 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-21 17:27:49,964 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:27:49,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-21 17:27:50,048 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:27:50,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:27:50,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:27:50,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:27:51,402 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:27:51,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2022-11-21 17:27:51,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 17:27:52,630 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:27:52,630 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 75 treesize of output 38 [2022-11-21 17:27:52,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2022-11-21 17:27:52,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-21 17:27:53,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:27:54,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:54,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:54,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:54,468 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-21 17:27:54,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:27:54,504 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:27:54,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 65 [2022-11-21 17:27:54,544 INFO L321 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-21 17:27:54,544 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 1 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 17:27:54,632 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-21 17:27:54,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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-21 17:27:59,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:27:59,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:27:59,667 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2022-11-21 17:27:59,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 185 treesize of output 102 [2022-11-21 17:27:59,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:27:59,764 INFO L321 Elim1Store]: treesize reduction 132, result has 18.5 percent of original size [2022-11-21 17:27:59,764 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 184 treesize of output 142 [2022-11-21 17:27:59,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-21 17:28:00,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:28:01,007 INFO L321 Elim1Store]: treesize reduction 120, result has 17.8 percent of original size [2022-11-21 17:28:01,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 564 treesize of output 184 [2022-11-21 17:28:01,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:28:01,162 INFO L321 Elim1Store]: treesize reduction 275, result has 11.6 percent of original size [2022-11-21 17:28:01,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 539 treesize of output 257 [2022-11-21 17:28:01,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:28:01,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 100 [2022-11-21 17:28:04,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:28:04,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:28:04,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:28:04,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 12 [2022-11-21 17:28:06,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:28:06,467 INFO L321 Elim1Store]: treesize reduction 158, result has 12.7 percent of original size [2022-11-21 17:28:06,467 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 14 new quantified variables, introduced 20 case distinctions, treesize of input 308 treesize of output 154 [2022-11-21 17:28:06,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:28:06,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:28:06,523 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-21 17:28:06,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 46 [2022-11-21 17:28:07,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 15 treesize of output 7 [2022-11-21 17:28:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:28:07,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:28:21,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:28:21,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3539 treesize of output 3532 [2022-11-21 17:28:21,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:28:21,322 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 38318 treesize of output 36587 [2022-11-21 17:28:21,371 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 41788 treesize of output 34856 [2022-11-21 17:28:22,008 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 1736 treesize of output 3 [2022-11-21 17:28:22,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:28:22,105 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 8705 treesize of output 8707 [2022-11-21 17:30:13,157 WARN L233 SmtUtils]: Spent 28.43s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:30:13,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978502656] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:30:13,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:30:13,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 85 [2022-11-21 17:30:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682942341] [2022-11-21 17:30:13,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:30:13,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-21 17:30:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:30:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-21 17:30:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=10675, Unknown=13, NotChecked=0, Total=11130 [2022-11-21 17:30:13,163 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 85 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 75 states have internal predecessors, (126), 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-21 17:30:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:30:54,285 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-11-21 17:30:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-21 17:30:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 75 states have internal predecessors, (126), 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 70 [2022-11-21 17:30:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:30:54,286 INFO L225 Difference]: With dead ends: 117 [2022-11-21 17:30:54,286 INFO L226 Difference]: Without dead ends: 117 [2022-11-21 17:30:54,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4568 ImplicationChecksByTransitivity, 173.5s TimeCoverageRelationStatistics Valid=1229, Invalid=17662, Unknown=15, NotChecked=0, Total=18906 [2022-11-21 17:30:54,288 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 798 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 2953 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 3006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2953 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:30:54,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1049 Invalid, 3006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2953 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2022-11-21 17:30:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-21 17:30:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-11-21 17:30:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.25) internal successors, (100), 94 states have internal predecessors, (100), 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-21 17:30:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-11-21 17:30:54,293 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 70 [2022-11-21 17:30:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:30:54,293 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-11-21 17:30:54,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 75 states have internal predecessors, (126), 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-21 17:30:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-11-21 17:30:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-21 17:30:54,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:30:54,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-21 17:30:54,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-11-21 17:30:54,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-21 17:30:54,499 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-21 17:30:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:30:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1692406426, now seen corresponding path program 3 times [2022-11-21 17:30:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:30:54,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143421286] [2022-11-21 17:30:54,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:30:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:30:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:30:59,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 17:30:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:30:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:30:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:31:00,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:31:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:31:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:31:01,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:31:01,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143421286] [2022-11-21 17:31:01,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143421286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:31:01,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851803558] [2022-11-21 17:31:01,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:31:01,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:31:01,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:31:01,649 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:31:01,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86b520c8-4edd-4e21-8f0c-cf05af98abfa/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-21 17:31:02,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-21 17:31:02,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:31:02,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 178 conjunts are in the unsatisfiable core [2022-11-21 17:31:02,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:31:03,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-21 17:31:04,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-21 17:31:05,188 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:31:05,188 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-21 17:31:05,836 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-21 17:31:05,869 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-21 17:31:06,714 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:31:06,714 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 42 [2022-11-21 17:31:06,736 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-21 17:31:07,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:31:07,843 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:31:07,844 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 77 treesize of output 36 [2022-11-21 17:31:07,862 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2022-11-21 17:31:07,872 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-21 17:31:08,156 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-21 17:31:09,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:31:09,658 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-21 17:31:09,659 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 85 treesize of output 75 [2022-11-21 17:31:09,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:31:09,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:31:09,685 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:31:09,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 85 [2022-11-21 17:31:09,775 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-21 17:31:09,776 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 32 treesize of output 34 [2022-11-21 17:31:14,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:31:14,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:31:14,416 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-11-21 17:31:14,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 171 treesize of output 96 [2022-11-21 17:31:14,543 INFO L321 Elim1Store]: treesize reduction 144, result has 13.3 percent of original size [2022-11-21 17:31:14,544 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 161 treesize of output 114 [2022-11-21 17:31:15,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:31:15,727 INFO L321 Elim1Store]: treesize reduction 108, result has 19.4 percent of original size [2022-11-21 17:31:15,727 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 109 [2022-11-21 17:31:15,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:31:15,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:31:15,776 INFO L321 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2022-11-21 17:31:15,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 108 [2022-11-21 17:31:20,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:31:20,448 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 17:31:22,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:31:22,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:31:22,385 INFO L321 Elim1Store]: treesize reduction 235, result has 8.6 percent of original size [2022-11-21 17:31:22,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 237 treesize of output 139 [2022-11-21 17:31:22,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:31:22,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:31:22,423 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 17:31:22,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 31 [2022-11-21 17:31:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:31:22,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:31:35,858 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 14885 treesize of output 11423 [2022-11-21 17:31:52,726 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:31:52,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851803558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:31:52,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:31:52,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 79 [2022-11-21 17:31:52,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548539681] [2022-11-21 17:31:52,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:31:52,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-21 17:31:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:31:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-21 17:31:52,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=8995, Unknown=1, NotChecked=0, Total=9312 [2022-11-21 17:31:52,730 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 79 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 70 states have internal predecessors, (134), 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)