./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:37:05,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:37:05,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:37:05,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:37:05,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:37:05,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:37:05,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:37:05,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:37:05,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:37:05,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:37:05,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:37:05,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:37:05,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:37:05,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:37:05,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:37:05,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:37:05,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:37:05,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:37:05,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:37:05,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:37:05,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:37:05,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:37:05,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:37:05,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:37:05,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:37:05,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:37:05,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:37:05,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:37:05,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:37:05,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:37:06,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:37:06,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:37:06,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:37:06,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:37:06,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:37:06,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:37:06,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:37:06,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:37:06,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:37:06,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:37:06,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:37:06,010 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:37:06,052 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:37:06,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:37:06,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:37:06,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:37:06,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:37:06,059 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:37:06,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:37:06,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:37:06,060 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:37:06,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:37:06,061 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:37:06,062 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:37:06,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:37:06,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:37:06,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:37:06,063 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:37:06,063 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:37:06,063 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:37:06,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:37:06,064 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:37:06,064 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:37:06,064 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:37:06,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:37:06,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:37:06,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:37:06,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:37:06,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:37:06,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:37:06,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:37:06,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:37:06,068 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_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2022-11-16 11:37:06,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:37:06,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:37:06,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:37:06,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:37:06,450 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:37:06,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-11-16 11:37:06,531 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/data/ae75a5d93/fc256713523046aab0e78548eb510e5e/FLAGe0d4106ee [2022-11-16 11:37:07,071 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:37:07,072 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-11-16 11:37:07,084 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/data/ae75a5d93/fc256713523046aab0e78548eb510e5e/FLAGe0d4106ee [2022-11-16 11:37:07,371 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/data/ae75a5d93/fc256713523046aab0e78548eb510e5e [2022-11-16 11:37:07,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:37:07,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:37:07,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:37:07,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:37:07,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:37:07,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:07,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac4420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07, skipping insertion in model container [2022-11-16 11:37:07,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:07,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:37:07,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:37:07,758 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-11-16 11:37:07,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:37:07,778 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:37:07,854 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-11-16 11:37:07,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:37:07,891 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:37:07,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07 WrapperNode [2022-11-16 11:37:07,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:37:07,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:37:07,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:37:07,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:37:07,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:07,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:07,959 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2022-11-16 11:37:07,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:37:07,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:37:07,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:37:07,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:37:07,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:07,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:07,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:07,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:08,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:08,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:08,008 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:08,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:08,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:37:08,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:37:08,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:37:08,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:37:08,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (1/1) ... [2022-11-16 11:37:08,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:37:08,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:08,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:37:08,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:37:08,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:37:08,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:37:08,121 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 11:37:08,121 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 11:37:08,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:37:08,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:37:08,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:37:08,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:37:08,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:37:08,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:37:08,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:37:08,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:37:08,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:37:08,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:37:08,276 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:37:08,279 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:37:08,804 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:37:08,812 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:37:08,812 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 11:37:08,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:37:08 BoogieIcfgContainer [2022-11-16 11:37:08,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:37:08,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:37:08,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:37:08,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:37:08,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:37:07" (1/3) ... [2022-11-16 11:37:08,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361d302b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:37:08, skipping insertion in model container [2022-11-16 11:37:08,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:07" (2/3) ... [2022-11-16 11:37:08,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361d302b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:37:08, skipping insertion in model container [2022-11-16 11:37:08,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:37:08" (3/3) ... [2022-11-16 11:37:08,826 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-11-16 11:37:08,850 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:37:08,850 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-11-16 11:37:08,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:37:08,914 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;@2e792249, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:37:08,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-16 11:37:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:37:08,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:08,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:08,929 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:08,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348631, now seen corresponding path program 1 times [2022-11-16 11:37:08,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:08,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79024960] [2022-11-16 11:37:08,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:37:09,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:09,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79024960] [2022-11-16 11:37:09,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79024960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:09,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:09,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:37:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572272017] [2022-11-16 11:37:09,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:09,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:37:09,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:09,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:37:09,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:09,244 INFO L87 Difference]: Start difference. First operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:09,413 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-11-16 11:37:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:37:09,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-11-16 11:37:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:09,423 INFO L225 Difference]: With dead ends: 94 [2022-11-16 11:37:09,424 INFO L226 Difference]: Without dead ends: 91 [2022-11-16 11:37:09,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:09,429 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:09,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:09,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-16 11:37:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-16 11:37:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.88) internal successors, (94), 87 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-11-16 11:37:09,483 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 7 [2022-11-16 11:37:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:09,483 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-11-16 11:37:09,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-11-16 11:37:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:37:09,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:09,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:09,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:37:09,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348632, now seen corresponding path program 1 times [2022-11-16 11:37:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:09,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165405452] [2022-11-16 11:37:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:09,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:37:09,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:09,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165405452] [2022-11-16 11:37:09,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165405452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:09,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:09,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:37:09,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257847028] [2022-11-16 11:37:09,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:09,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:37:09,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:09,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:37:09,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:09,612 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:09,697 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-11-16 11:37:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:37:09,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-11-16 11:37:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:09,699 INFO L225 Difference]: With dead ends: 88 [2022-11-16 11:37:09,699 INFO L226 Difference]: Without dead ends: 88 [2022-11-16 11:37:09,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:09,701 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:09,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-16 11:37:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-16 11:37:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.82) internal successors, (91), 84 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-16 11:37:09,716 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 7 [2022-11-16 11:37:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:09,717 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-16 11:37:09,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:09,717 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-16 11:37:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:37:09,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:09,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:09,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:37:09,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:09,719 INFO L85 PathProgramCache]: Analyzing trace with hash 927333361, now seen corresponding path program 1 times [2022-11-16 11:37:09,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:09,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091181430] [2022-11-16 11:37:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:10,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:37:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091181430] [2022-11-16 11:37:10,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091181430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:10,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:10,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:37:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676261200] [2022-11-16 11:37:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:10,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:37:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:10,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:37:10,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:37:10,265 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:37:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:10,554 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-11-16 11:37:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:37:10,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2022-11-16 11:37:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:10,564 INFO L225 Difference]: With dead ends: 91 [2022-11-16 11:37:10,564 INFO L226 Difference]: Without dead ends: 91 [2022-11-16 11:37:10,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-16 11:37:10,573 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 22 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:10,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 364 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:10,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-16 11:37:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-11-16 11:37:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.78) internal successors, (89), 82 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-11-16 11:37:10,594 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 14 [2022-11-16 11:37:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:10,595 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-11-16 11:37:10,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:37:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-11-16 11:37:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:37:10,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:10,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:10,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:37:10,598 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash 927333360, now seen corresponding path program 1 times [2022-11-16 11:37:10,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:10,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596426539] [2022-11-16 11:37:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:37:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:10,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596426539] [2022-11-16 11:37:10,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596426539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:10,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:10,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:37:10,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319048166] [2022-11-16 11:37:10,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:10,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:37:10,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:10,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:37:10,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:37:10,791 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:37:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:11,022 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-11-16 11:37:11,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:37:11,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2022-11-16 11:37:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:11,025 INFO L225 Difference]: With dead ends: 89 [2022-11-16 11:37:11,025 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 11:37:11,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:37:11,035 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 15 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:11,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 316 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 11:37:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-11-16 11:37:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.74) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-11-16 11:37:11,057 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2022-11-16 11:37:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:11,058 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-11-16 11:37:11,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:37:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-11-16 11:37:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:37:11,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:11,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:11,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:37:11,061 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:11,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1763306156, now seen corresponding path program 1 times [2022-11-16 11:37:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:11,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394469963] [2022-11-16 11:37:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:11,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:37:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:37:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:11,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394469963] [2022-11-16 11:37:11,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394469963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:11,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:11,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:37:11,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767119590] [2022-11-16 11:37:11,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:11,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:37:11,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:11,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:37:11,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:11,144 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:37:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:11,255 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-11-16 11:37:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:37:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-11-16 11:37:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:11,257 INFO L225 Difference]: With dead ends: 94 [2022-11-16 11:37:11,257 INFO L226 Difference]: Without dead ends: 94 [2022-11-16 11:37:11,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:11,258 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:11,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 211 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-16 11:37:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-11-16 11:37:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-11-16 11:37:11,271 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2022-11-16 11:37:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:11,271 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-11-16 11:37:11,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:37:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-11-16 11:37:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:37:11,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:11,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:11,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:37:11,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash 958467140, now seen corresponding path program 1 times [2022-11-16 11:37:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:11,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131546514] [2022-11-16 11:37:11,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:11,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:37:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:11,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131546514] [2022-11-16 11:37:11,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131546514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:11,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:11,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:37:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229397582] [2022-11-16 11:37:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:11,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:37:11,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:11,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:37:11,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:11,399 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:37:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:11,499 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-11-16 11:37:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:37:11,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2022-11-16 11:37:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:11,500 INFO L225 Difference]: With dead ends: 91 [2022-11-16 11:37:11,500 INFO L226 Difference]: Without dead ends: 91 [2022-11-16 11:37:11,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:11,502 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:11,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 207 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-16 11:37:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-11-16 11:37:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.6727272727272726) 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-16 11:37:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-11-16 11:37:11,521 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 17 [2022-11-16 11:37:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:11,521 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-11-16 11:37:11,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 11:37:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-11-16 11:37:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 11:37:11,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:11,523 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:11,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:37:11,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash 239866037, now seen corresponding path program 1 times [2022-11-16 11:37:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:11,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665467412] [2022-11-16 11:37:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:11,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:11,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:37:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:37:11,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:11,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665467412] [2022-11-16 11:37:11,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665467412] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522689812] [2022-11-16 11:37:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:11,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:11,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:11,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:11,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:37:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:11,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:37:11,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:37:11,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:37:12,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522689812] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:37:12,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:37:12,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-16 11:37:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239107362] [2022-11-16 11:37:12,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:12,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:37:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:12,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:37:12,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:37:12,038 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:37:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:12,147 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-11-16 11:37:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:37:12,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-11-16 11:37:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:12,149 INFO L225 Difference]: With dead ends: 92 [2022-11-16 11:37:12,149 INFO L226 Difference]: Without dead ends: 92 [2022-11-16 11:37:12,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:37:12,150 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 14 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:12,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 218 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-16 11:37:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-16 11:37:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-11-16 11:37:12,155 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 31 [2022-11-16 11:37:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:12,156 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-11-16 11:37:12,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:37:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-11-16 11:37:12,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:37:12,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:12,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:12,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:37:12,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 11:37:12,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:12,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704317, now seen corresponding path program 1 times [2022-11-16 11:37:12,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:12,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572306564] [2022-11-16 11:37:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:12,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:12,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:37:12,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:12,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572306564] [2022-11-16 11:37:12,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572306564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:12,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008653901] [2022-11-16 11:37:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:12,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:12,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:12,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:12,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:37:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:13,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 11:37:13,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:13,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:37:13,219 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_510 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:37:13,338 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:37:13,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:37:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 11:37:13,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:13,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008653901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:13,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:13,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-11-16 11:37:13,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748919652] [2022-11-16 11:37:13,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:13,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:37:13,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:13,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:37:13,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2022-11-16 11:37:13,416 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:37:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:13,823 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-11-16 11:37:13,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:37:13,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-11-16 11:37:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:13,824 INFO L225 Difference]: With dead ends: 103 [2022-11-16 11:37:13,824 INFO L226 Difference]: Without dead ends: 103 [2022-11-16 11:37:13,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2022-11-16 11:37:13,825 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 146 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:13,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 275 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 359 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2022-11-16 11:37:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-16 11:37:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2022-11-16 11:37:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.631578947368421) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-11-16 11:37:13,830 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 32 [2022-11-16 11:37:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:13,830 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-11-16 11:37:13,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:37:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-11-16 11:37:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:37:13,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:13,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:13,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:37:14,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:14,037 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704316, now seen corresponding path program 1 times [2022-11-16 11:37:14,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:14,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329264120] [2022-11-16 11:37:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:14,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:14,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:37:14,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329264120] [2022-11-16 11:37:14,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329264120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858895965] [2022-11-16 11:37:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:14,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:14,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:14,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:37:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:14,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 11:37:14,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:14,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:37:15,265 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-11-16 11:37:15,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2022-11-16 11:37:15,284 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:37:15,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:37:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:37:15,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:19,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858895965] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:19,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:19,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2022-11-16 11:37:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928239165] [2022-11-16 11:37:19,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:19,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:37:19,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:37:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:37:19,535 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 11:37:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:20,319 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-11-16 11:37:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:37:20,320 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-11-16 11:37:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:20,321 INFO L225 Difference]: With dead ends: 91 [2022-11-16 11:37:20,321 INFO L226 Difference]: Without dead ends: 91 [2022-11-16 11:37:20,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:37:20,322 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:20,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 515 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:37:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-16 11:37:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-11-16 11:37:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.6140350877192982) 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-16 11:37:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-11-16 11:37:20,326 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 32 [2022-11-16 11:37:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:20,331 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-11-16 11:37:20,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 11:37:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-11-16 11:37:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 11:37:20,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:20,335 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:20,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:37:20,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:20,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1122646220, now seen corresponding path program 2 times [2022-11-16 11:37:20,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:20,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592391962] [2022-11-16 11:37:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:20,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:20,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:37:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:37:20,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:20,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592391962] [2022-11-16 11:37:20,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592391962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:20,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056752465] [2022-11-16 11:37:20,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:37:20,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:20,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:20,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:20,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:37:21,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:37:21,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:37:21,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 11:37:21,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:21,101 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-16 11:37:21,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:37:21,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056752465] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:37:21,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:37:21,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-11-16 11:37:21,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220259790] [2022-11-16 11:37:21,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:21,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:37:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:21,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:37:21,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:37:21,198 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:37:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:21,425 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-11-16 11:37:21,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:37:21,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-11-16 11:37:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:21,426 INFO L225 Difference]: With dead ends: 90 [2022-11-16 11:37:21,427 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 11:37:21,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:37:21,428 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 144 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:21,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 355 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 11:37:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-16 11:37:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-11-16 11:37:21,431 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 46 [2022-11-16 11:37:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:21,432 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-11-16 11:37:21,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:37:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-11-16 11:37:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 11:37:21,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:21,433 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] [2022-11-16 11:37:21,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 11:37:21,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 11:37:21,634 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash 186649324, now seen corresponding path program 1 times [2022-11-16 11:37:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:21,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607486728] [2022-11-16 11:37:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:22,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:22,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:22,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:37:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:22,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607486728] [2022-11-16 11:37:22,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607486728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:22,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486803913] [2022-11-16 11:37:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:22,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:22,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:37:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:22,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 11:37:22,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:22,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:37:22,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:37:22,531 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1168 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1168)))) is different from true [2022-11-16 11:37:22,559 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1168 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1168)))) is different from true [2022-11-16 11:37:22,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:22,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:37:22,680 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-16 11:37:22,740 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:37:22,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:37:22,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:22,984 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 11:37:22,985 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 17 treesize of output 22 [2022-11-16 11:37:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2022-11-16 11:37:23,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:23,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486803913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:23,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:23,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-11-16 11:37:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383793559] [2022-11-16 11:37:23,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:23,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:37:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:37:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=280, Unknown=3, NotChecked=108, Total=462 [2022-11-16 11:37:23,286 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:37:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:23,787 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-11-16 11:37:23,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:37:23,788 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-11-16 11:37:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:23,789 INFO L225 Difference]: With dead ends: 90 [2022-11-16 11:37:23,789 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 11:37:23,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=533, Unknown=3, NotChecked=150, Total=812 [2022-11-16 11:37:23,790 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 13 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:23,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 459 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 346 Unchecked, 0.3s Time] [2022-11-16 11:37:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 11:37:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-11-16 11:37:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.5789473684210527) 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-16 11:37:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-11-16 11:37:23,794 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 47 [2022-11-16 11:37:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:23,794 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-11-16 11:37:23,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:37:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-11-16 11:37:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 11:37:23,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:23,795 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] [2022-11-16 11:37:23,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:37:24,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 11:37:24,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:24,002 INFO L85 PathProgramCache]: Analyzing trace with hash 186649325, now seen corresponding path program 1 times [2022-11-16 11:37:24,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:24,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365571423] [2022-11-16 11:37:24,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:24,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:24,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 11:37:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:24,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365571423] [2022-11-16 11:37:24,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365571423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:24,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205442466] [2022-11-16 11:37:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:24,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:24,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:24,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:24,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:37:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:24,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 11:37:24,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:24,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:37:24,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:37:25,014 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1418 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1418) |c_#length|)))) is different from true [2022-11-16 11:37:25,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:25,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:37:25,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:37:25,114 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1419 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1419) |c_#length|)))) is different from true [2022-11-16 11:37:25,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:25,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:37:25,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:37:25,276 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1420 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1420) |c_#length|)))) is different from true [2022-11-16 11:37:25,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:25,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:37:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 21 not checked. [2022-11-16 11:37:25,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:25,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205442466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:25,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:25,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-16 11:37:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209240148] [2022-11-16 11:37:25,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:25,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:37:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:37:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=167, Unknown=3, NotChecked=84, Total=306 [2022-11-16 11:37:25,468 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:37:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:25,891 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-11-16 11:37:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:37:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2022-11-16 11:37:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:25,893 INFO L225 Difference]: With dead ends: 95 [2022-11-16 11:37:25,893 INFO L226 Difference]: Without dead ends: 95 [2022-11-16 11:37:25,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=207, Unknown=3, NotChecked=96, Total=380 [2022-11-16 11:37:25,894 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 215 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:25,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 210 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 296 Invalid, 0 Unknown, 273 Unchecked, 0.4s Time] [2022-11-16 11:37:25,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-16 11:37:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-11-16 11:37:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2022-11-16 11:37:25,898 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 47 [2022-11-16 11:37:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:25,899 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2022-11-16 11:37:25,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:37:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-11-16 11:37:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 11:37:25,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:25,900 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] [2022-11-16 11:37:25,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 11:37:26,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:26,101 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1018625491, now seen corresponding path program 1 times [2022-11-16 11:37:26,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:26,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553386702] [2022-11-16 11:37:26,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:26,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:26,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:26,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:26,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 11:37:26,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:26,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553386702] [2022-11-16 11:37:26,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553386702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:26,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:26,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:37:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462792348] [2022-11-16 11:37:26,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:26,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:37:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:26,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:37:26,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:26,206 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:37:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:26,303 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-11-16 11:37:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:37:26,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-11-16 11:37:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:26,304 INFO L225 Difference]: With dead ends: 93 [2022-11-16 11:37:26,304 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 11:37:26,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:26,305 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 50 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:26,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 117 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:26,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 11:37:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-11-16 11:37:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 76 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-16 11:37:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2022-11-16 11:37:26,308 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 49 [2022-11-16 11:37:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:26,308 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2022-11-16 11:37:26,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:37:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2022-11-16 11:37:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:37:26,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:26,309 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] [2022-11-16 11:37:26,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:37:26,310 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:26,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:26,313 INFO L85 PathProgramCache]: Analyzing trace with hash 353447346, now seen corresponding path program 1 times [2022-11-16 11:37:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:26,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379192400] [2022-11-16 11:37:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:26,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:26,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 11:37:27,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:27,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379192400] [2022-11-16 11:37:27,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379192400] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:27,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648118234] [2022-11-16 11:37:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:27,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:27,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:27,206 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:27,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:37:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:27,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 11:37:27,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:27,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:37:27,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-16 11:37:28,003 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1824 (Array Int Int)) (|node_create_~temp~0#1.base| 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|)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1824) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:37:28,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:28,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:37:28,070 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-11-16 11:37:28,070 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 23 treesize of output 24 [2022-11-16 11:37:28,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 11:37:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-16 11:37:28,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:28,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648118234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:28,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:28,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2022-11-16 11:37:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632376160] [2022-11-16 11:37:28,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:28,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:37:28,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:28,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:37:28,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2022-11-16 11:37:28,288 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:37:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:29,079 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-11-16 11:37:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:37:29,079 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-16 11:37:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:29,080 INFO L225 Difference]: With dead ends: 111 [2022-11-16 11:37:29,080 INFO L226 Difference]: Without dead ends: 111 [2022-11-16 11:37:29,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=979, Unknown=1, NotChecked=64, Total=1190 [2022-11-16 11:37:29,082 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 86 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:29,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 547 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 545 Invalid, 0 Unknown, 79 Unchecked, 0.5s Time] [2022-11-16 11:37:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-16 11:37:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2022-11-16 11:37:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 75 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-16 11:37:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-11-16 11:37:29,085 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 51 [2022-11-16 11:37:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:29,086 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-11-16 11:37:29,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:37:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-11-16 11:37:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:37:29,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:29,087 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] [2022-11-16 11:37:29,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:37:29,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:37:29,293 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash 353447347, now seen corresponding path program 1 times [2022-11-16 11:37:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:29,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827597185] [2022-11-16 11:37:29,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:37:30,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:30,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827597185] [2022-11-16 11:37:30,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827597185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:30,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154913602] [2022-11-16 11:37:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:30,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:30,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:30,992 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:30,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:37:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:31,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 11:37:31,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:31,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:37:31,862 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 17 [2022-11-16 11:37:31,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 11:37:32,181 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2083 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2083) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2078 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2078) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2084 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2084))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:37:32,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:32,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-16 11:37:32,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:32,265 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 22 treesize of output 24 [2022-11-16 11:37:32,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:32,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-16 11:37:32,294 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:37:32,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 11:37:32,385 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 23 treesize of output 15 [2022-11-16 11:37:32,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-16 11:37:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-16 11:37:32,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:32,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154913602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:32,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:32,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-11-16 11:37:32,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313005446] [2022-11-16 11:37:32,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:32,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 11:37:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:32,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 11:37:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1225, Unknown=2, NotChecked=70, Total=1406 [2022-11-16 11:37:32,892 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:37:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:35,138 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-11-16 11:37:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:37:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-16 11:37:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:35,140 INFO L225 Difference]: With dead ends: 119 [2022-11-16 11:37:35,140 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 11:37:35,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=219, Invalid=2132, Unknown=5, NotChecked=94, Total=2450 [2022-11-16 11:37:35,142 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 188 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:35,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1390 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1070 Invalid, 0 Unknown, 203 Unchecked, 1.1s Time] [2022-11-16 11:37:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 11:37:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2022-11-16 11:37:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 78 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-11-16 11:37:35,145 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 51 [2022-11-16 11:37:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:35,146 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-11-16 11:37:35,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:37:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-11-16 11:37:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:37:35,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:35,147 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] [2022-11-16 11:37:35,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:37:35,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:35,354 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash 353294446, now seen corresponding path program 1 times [2022-11-16 11:37:35,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:35,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220212431] [2022-11-16 11:37:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:35,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:35,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:35,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 11:37:35,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:35,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220212431] [2022-11-16 11:37:35,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220212431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:35,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:35,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:37:35,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359077752] [2022-11-16 11:37:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:35,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:37:35,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:37:35,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:37:35,538 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:35,629 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-11-16 11:37:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:37:35,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-11-16 11:37:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:35,631 INFO L225 Difference]: With dead ends: 94 [2022-11-16 11:37:35,631 INFO L226 Difference]: Without dead ends: 94 [2022-11-16 11:37:35,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:37:35,632 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 156 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:35,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 137 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-16 11:37:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2022-11-16 11:37:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-11-16 11:37:35,636 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 51 [2022-11-16 11:37:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:35,636 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-11-16 11:37:35,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-11-16 11:37:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 11:37:35,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:35,637 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] [2022-11-16 11:37:35,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:37:35,638 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:35,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893007, now seen corresponding path program 1 times [2022-11-16 11:37:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:35,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057927587] [2022-11-16 11:37:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:35,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:35,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:35,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 11:37:35,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:35,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057927587] [2022-11-16 11:37:35,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057927587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:35,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:35,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:37:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55205890] [2022-11-16 11:37:35,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:35,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:37:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:35,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:37:35,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:37:35,836 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:37:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:36,015 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-11-16 11:37:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:37:36,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 54 [2022-11-16 11:37:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:36,016 INFO L225 Difference]: With dead ends: 93 [2022-11-16 11:37:36,016 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 11:37:36,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:37:36,017 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 44 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:36,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 219 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 11:37:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-11-16 11:37:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.360655737704918) internal successors, (83), 76 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-16 11:37:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2022-11-16 11:37:36,021 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 54 [2022-11-16 11:37:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:36,021 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2022-11-16 11:37:36,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:37:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-11-16 11:37:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 11:37:36,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:36,022 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] [2022-11-16 11:37:36,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:37:36,023 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:36,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893006, now seen corresponding path program 1 times [2022-11-16 11:37:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:36,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518198429] [2022-11-16 11:37:36,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:36,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:36,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:36,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:36,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 11:37:36,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:36,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518198429] [2022-11-16 11:37:36,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518198429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:36,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:36,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:37:36,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460451188] [2022-11-16 11:37:36,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:36,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:37:36,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:36,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:37:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:37:36,401 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:37:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:36,573 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-11-16 11:37:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:37:36,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 54 [2022-11-16 11:37:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:36,574 INFO L225 Difference]: With dead ends: 80 [2022-11-16 11:37:36,574 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 11:37:36,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:37:36,575 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:36,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 218 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 11:37:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-16 11:37:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 75 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-16 11:37:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-11-16 11:37:36,578 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 54 [2022-11-16 11:37:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:36,578 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-11-16 11:37:36,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:37:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-11-16 11:37:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 11:37:36,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:36,579 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] [2022-11-16 11:37:36,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:37:36,579 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:36,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948792, now seen corresponding path program 1 times [2022-11-16 11:37:36,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:36,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415707536] [2022-11-16 11:37:36,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:36,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 11:37:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:36,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415707536] [2022-11-16 11:37:36,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415707536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:36,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:36,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:37:36,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432953942] [2022-11-16 11:37:36,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:36,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:37:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:36,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:37:36,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:37:36,979 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:37,303 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-11-16 11:37:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:37:37,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-11-16 11:37:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:37,305 INFO L225 Difference]: With dead ends: 141 [2022-11-16 11:37:37,305 INFO L226 Difference]: Without dead ends: 141 [2022-11-16 11:37:37,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:37:37,306 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 240 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:37,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 323 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:37,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-16 11:37:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2022-11-16 11:37:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 79 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-16 11:37:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-11-16 11:37:37,311 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 54 [2022-11-16 11:37:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:37,311 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-11-16 11:37:37,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-11-16 11:37:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 11:37:37,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:37,312 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] [2022-11-16 11:37:37,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:37:37,313 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948791, now seen corresponding path program 1 times [2022-11-16 11:37:37,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:37,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704944830] [2022-11-16 11:37:37,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:37,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 11:37:37,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:37,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704944830] [2022-11-16 11:37:37,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704944830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:37,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:37,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:37:37,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145363004] [2022-11-16 11:37:37,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:37,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:37:37,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:37,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:37:37,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:37:37,908 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:38,266 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2022-11-16 11:37:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:37:38,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-11-16 11:37:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:38,267 INFO L225 Difference]: With dead ends: 131 [2022-11-16 11:37:38,267 INFO L226 Difference]: Without dead ends: 131 [2022-11-16 11:37:38,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:37:38,268 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 226 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:38,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 325 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:37:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-16 11:37:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. [2022-11-16 11:37:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 81 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-16 11:37:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-11-16 11:37:38,272 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 54 [2022-11-16 11:37:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:38,272 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-11-16 11:37:38,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-11-16 11:37:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:37:38,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:38,273 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] [2022-11-16 11:37:38,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:37:38,274 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:38,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1467023000, now seen corresponding path program 1 times [2022-11-16 11:37:38,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:38,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977601118] [2022-11-16 11:37:38,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:39,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:39,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:39,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:37:40,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:40,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977601118] [2022-11-16 11:37:40,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977601118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:40,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671141016] [2022-11-16 11:37:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:40,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:40,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:40,871 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:40,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:37:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:41,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-16 11:37:41,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:41,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:37:41,650 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:37:41,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:37:41,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:37:42,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:37:42,055 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 34 treesize of output 35 [2022-11-16 11:37:42,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:42,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:37:42,459 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 1 case distinctions, treesize of input 51 treesize of output 18 [2022-11-16 11:37:42,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:37:42,763 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3142 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_3143 (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|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3143)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3142)))) is different from true [2022-11-16 11:37:42,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:42,833 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:37:42,833 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 57 treesize of output 55 [2022-11-16 11:37:42,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:42,848 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 58 [2022-11-16 11:37:42,897 INFO L321 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2022-11-16 11:37:42,898 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 42 treesize of output 64 [2022-11-16 11:37:43,045 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 63 treesize of output 43 [2022-11-16 11:37:43,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:43,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:37:43,293 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 1 case distinctions, treesize of input 56 treesize of output 21 [2022-11-16 11:37:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:37:43,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:43,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671141016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:43,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:43,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2022-11-16 11:37:43,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969843863] [2022-11-16 11:37:43,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:43,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-16 11:37:43,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:43,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-16 11:37:43,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2448, Unknown=1, NotChecked=100, Total=2756 [2022-11-16 11:37:43,831 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:37:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:45,224 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2022-11-16 11:37:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:37:45,224 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 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 55 [2022-11-16 11:37:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:45,225 INFO L225 Difference]: With dead ends: 89 [2022-11-16 11:37:45,225 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 11:37:45,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=318, Invalid=3345, Unknown=1, NotChecked=118, Total=3782 [2022-11-16 11:37:45,228 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 66 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:45,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 680 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 626 Invalid, 0 Unknown, 121 Unchecked, 0.7s Time] [2022-11-16 11:37:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 11:37:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-11-16 11:37:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-11-16 11:37:45,232 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 55 [2022-11-16 11:37:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:45,232 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-11-16 11:37:45,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:37:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-11-16 11:37:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:37:45,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:45,233 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] [2022-11-16 11:37:45,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:37:45,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:45,434 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1467022999, now seen corresponding path program 1 times [2022-11-16 11:37:45,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:45,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676373781] [2022-11-16 11:37:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:45,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:47,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:37:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:49,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676373781] [2022-11-16 11:37:49,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676373781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:49,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585674912] [2022-11-16 11:37:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:49,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:49,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:49,319 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:49,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:37:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:49,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-16 11:37:49,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:49,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:37:50,367 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:37:50,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:37:50,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:37:50,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:37:50,782 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:37:50,782 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 65 treesize of output 62 [2022-11-16 11:37:50,793 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 41 [2022-11-16 11:37:51,337 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:37:51,338 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 1 case distinctions, treesize of input 73 treesize of output 36 [2022-11-16 11:37:51,355 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:37:51,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-11-16 11:37:51,804 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3415 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3415))) (exists ((v_ArrVal_3409 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3409) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3414 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3414) |c_#memory_$Pointer$.base|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:37:51,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:51,871 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:37:51,871 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 67 [2022-11-16 11:37:51,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:51,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:51,891 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:37:51,891 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 48 treesize of output 47 [2022-11-16 11:37:51,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:51,902 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 30 treesize of output 32 [2022-11-16 11:37:51,925 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:37:51,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:37:52,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:52,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:37:52,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:37:52,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 45 [2022-11-16 11:37:52,386 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-16 11:37:52,386 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 3 case distinctions, treesize of input 39 treesize of output 25 [2022-11-16 11:37:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:37:52,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:53,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585674912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:53,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:53,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 53 [2022-11-16 11:37:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719449770] [2022-11-16 11:37:53,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:53,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-16 11:37:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-16 11:37:53,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3230, Unknown=3, NotChecked=114, Total=3540 [2022-11-16 11:37:53,329 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 47 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:37:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:57,838 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2022-11-16 11:37:57,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:37:57,842 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 47 states have internal predecessors, (97), 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 55 [2022-11-16 11:37:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:57,843 INFO L225 Difference]: With dead ends: 167 [2022-11-16 11:37:57,843 INFO L226 Difference]: Without dead ends: 167 [2022-11-16 11:37:57,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=452, Invalid=5401, Unknown=3, NotChecked=150, Total=6006 [2022-11-16 11:37:57,845 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 550 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 468 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:57,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1443 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1725 Invalid, 0 Unknown, 468 Unchecked, 1.9s Time] [2022-11-16 11:37:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-16 11:37:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 90. [2022-11-16 11:37:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 85 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-11-16 11:37:57,850 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 55 [2022-11-16 11:37:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:57,850 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-11-16 11:37:57,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 47 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:37:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-11-16 11:37:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:37:57,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:57,851 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] [2022-11-16 11:37:57,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:37:58,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 11:37:58,058 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash -938871693, now seen corresponding path program 1 times [2022-11-16 11:37:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:58,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529970623] [2022-11-16 11:37:58,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:58,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:58,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:58,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 11:37:58,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:58,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529970623] [2022-11-16 11:37:58,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529970623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:58,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:58,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:37:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072615057] [2022-11-16 11:37:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:58,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:37:58,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:37:58,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:37:58,415 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:58,658 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2022-11-16 11:37:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:37:58,659 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-11-16 11:37:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:58,660 INFO L225 Difference]: With dead ends: 118 [2022-11-16 11:37:58,660 INFO L226 Difference]: Without dead ends: 118 [2022-11-16 11:37:58,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:37:58,661 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 157 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:58,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 515 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-16 11:37:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2022-11-16 11:37:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-11-16 11:37:58,666 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 55 [2022-11-16 11:37:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:58,666 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-11-16 11:37:58,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:37:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-11-16 11:37:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-16 11:37:58,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:58,668 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] [2022-11-16 11:37:58,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:37:58,668 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:37:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:58,669 INFO L85 PathProgramCache]: Analyzing trace with hash 959790642, now seen corresponding path program 1 times [2022-11-16 11:37:58,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:58,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064214201] [2022-11-16 11:37:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:58,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:37:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:59,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:37:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:59,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:37:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:37:59,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:59,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064214201] [2022-11-16 11:37:59,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064214201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:59,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647348856] [2022-11-16 11:37:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:59,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:59,299 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:59,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:37:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:59,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 11:37:59,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:59,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:38:00,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:38:00,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:00,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:38:00,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:38:00,257 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 28 treesize of output 16 [2022-11-16 11:38:00,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:38:00,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:38:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 11:38:00,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:38:00,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647348856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:00,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:38:00,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2022-11-16 11:38:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590655229] [2022-11-16 11:38:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:00,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:38:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:00,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:38:00,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-11-16 11:38:00,402 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:38:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:01,084 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-11-16 11:38:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:38:01,087 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-11-16 11:38:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:01,088 INFO L225 Difference]: With dead ends: 116 [2022-11-16 11:38:01,088 INFO L226 Difference]: Without dead ends: 116 [2022-11-16 11:38:01,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2022-11-16 11:38:01,089 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 146 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:01,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 568 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:38:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-16 11:38:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2022-11-16 11:38:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:38:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-11-16 11:38:01,093 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 56 [2022-11-16 11:38:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:01,093 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-11-16 11:38:01,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:38:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-11-16 11:38:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:38:01,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:01,095 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:01,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-16 11:38:01,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 11:38:01,301 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:38:01,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash -588248546, now seen corresponding path program 2 times [2022-11-16 11:38:01,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:01,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414404027] [2022-11-16 11:38:01,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:01,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:03,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:38:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:38:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:04,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:38:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:38:06,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:06,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414404027] [2022-11-16 11:38:06,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414404027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:06,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237802878] [2022-11-16 11:38:06,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:38:06,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:38:06,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:38:06,034 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:38:06,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:38:06,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:38:06,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:38:06,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-16 11:38:06,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:06,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:38:06,797 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-16 11:38:06,806 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-16 11:38:07,475 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:38:07,475 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 14 treesize of output 20 [2022-11-16 11:38:07,502 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:38:07,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 14 treesize of output 20 [2022-11-16 11:38:07,522 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:38:07,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:38:07,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:38:07,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:38:07,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 11:38:07,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 11:38:08,045 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-16 11:38:08,046 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 94 treesize of output 57 [2022-11-16 11:38:08,055 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 0 case distinctions, treesize of input 46 treesize of output 42 [2022-11-16 11:38:08,651 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-16 11:38:08,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 44 [2022-11-16 11:38:08,671 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:38:08,672 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 2 case distinctions, treesize of input 21 treesize of output 21 [2022-11-16 11:38:08,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:38:08,941 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4120 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_4119 (Array Int 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_4119)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_4120)))) is different from true [2022-11-16 11:38:08,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:09,011 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-16 11:38:09,011 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 116 treesize of output 106 [2022-11-16 11:38:09,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:09,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:09,037 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-16 11:38:09,037 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 110 [2022-11-16 11:38:09,066 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-16 11:38:09,067 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 34 treesize of output 36 [2022-11-16 11:38:10,037 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2022-11-16 11:38:10,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 74 [2022-11-16 11:38:10,060 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-16 11:38:10,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 32 [2022-11-16 11:38:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-16 11:38:10,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:11,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237802878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:11,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:11,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 56 [2022-11-16 11:38:11,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989559603] [2022-11-16 11:38:11,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:11,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-16 11:38:11,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:11,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-16 11:38:11,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3492, Unknown=2, NotChecked=118, Total=3782 [2022-11-16 11:38:11,103 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 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-16 11:38:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:15,390 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-11-16 11:38:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:38:15,390 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 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 59 [2022-11-16 11:38:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:15,391 INFO L225 Difference]: With dead ends: 114 [2022-11-16 11:38:15,391 INFO L226 Difference]: Without dead ends: 114 [2022-11-16 11:38:15,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=329, Invalid=5993, Unknown=2, NotChecked=156, Total=6480 [2022-11-16 11:38:15,394 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:15,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1499 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1415 Invalid, 0 Unknown, 299 Unchecked, 1.4s Time] [2022-11-16 11:38:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-16 11:38:15,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2022-11-16 11:38:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 105 states have internal predecessors, (116), 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-16 11:38:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-11-16 11:38:15,399 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 59 [2022-11-16 11:38:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:15,400 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-11-16 11:38:15,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 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-16 11:38:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-11-16 11:38:15,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:38:15,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:15,401 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] [2022-11-16 11:38:15,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:15,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 11:38:15,609 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:38:15,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:15,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094492, now seen corresponding path program 1 times [2022-11-16 11:38:15,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:15,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615213679] [2022-11-16 11:38:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:15,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:38:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:38:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:38:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:38:16,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:16,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615213679] [2022-11-16 11:38:16,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615213679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:16,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:16,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-16 11:38:16,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269756500] [2022-11-16 11:38:16,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:16,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:38:16,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:16,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:38:16,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:38:16,695 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:38:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:18,037 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2022-11-16 11:38:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:38:18,038 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2022-11-16 11:38:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:18,039 INFO L225 Difference]: With dead ends: 176 [2022-11-16 11:38:18,039 INFO L226 Difference]: Without dead ends: 176 [2022-11-16 11:38:18,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2022-11-16 11:38:18,040 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 593 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:18,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 473 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:38:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-16 11:38:18,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 119. [2022-11-16 11:38:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 112 states have internal predecessors, (125), 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-16 11:38:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2022-11-16 11:38:18,057 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 59 [2022-11-16 11:38:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:18,057 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2022-11-16 11:38:18,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:38:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-11-16 11:38:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:38:18,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:18,059 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] [2022-11-16 11:38:18,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 11:38:18,059 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:38:18,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:18,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094491, now seen corresponding path program 1 times [2022-11-16 11:38:18,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:18,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940433911] [2022-11-16 11:38:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:19,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:38:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:19,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:38:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:19,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:38:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:38:20,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:20,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940433911] [2022-11-16 11:38:20,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940433911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:20,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234451368] [2022-11-16 11:38:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:20,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:38:20,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:38:20,011 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:38:20,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:38:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:20,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-16 11:38:20,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:20,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:38:21,104 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 27 treesize of output 15 [2022-11-16 11:38:21,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:38:21,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:21,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:38:21,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:21,653 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 16 treesize of output 18 [2022-11-16 11:38:21,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:21,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-16 11:38:21,674 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:38:21,674 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-16 11:38:22,090 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 11:38:22,091 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 21 treesize of output 20 [2022-11-16 11:38:22,119 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-16 11:38:22,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2022-11-16 11:38:22,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:22,141 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-16 11:38:22,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:22,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:38:22,241 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-16 11:38:22,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:38:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:38:22,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:22,578 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4575 (Array Int Int)) (v_ArrVal_4576 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4576) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4575 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-16 11:38:26,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234451368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:26,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:26,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2022-11-16 11:38:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417779930] [2022-11-16 11:38:26,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:26,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-16 11:38:26,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:26,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-16 11:38:26,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2288, Unknown=7, NotChecked=96, Total=2550 [2022-11-16 11:38:26,410 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 42 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 36 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-16 11:38:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:29,918 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2022-11-16 11:38:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:38:29,919 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 36 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2022-11-16 11:38:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:29,920 INFO L225 Difference]: With dead ends: 182 [2022-11-16 11:38:29,921 INFO L226 Difference]: Without dead ends: 182 [2022-11-16 11:38:29,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=401, Invalid=4703, Unknown=12, NotChecked=140, Total=5256 [2022-11-16 11:38:29,923 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 264 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:29,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1428 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1230 Invalid, 0 Unknown, 59 Unchecked, 1.4s Time] [2022-11-16 11:38:29,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-16 11:38:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 122. [2022-11-16 11:38:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 115 states have internal predecessors, (128), 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-16 11:38:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2022-11-16 11:38:29,929 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 59 [2022-11-16 11:38:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:29,930 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2022-11-16 11:38:29,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 36 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-16 11:38:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2022-11-16 11:38:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:38:29,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:29,931 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-16 11:38:29,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:30,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 11:38:30,139 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:38:30,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1526484642, now seen corresponding path program 1 times [2022-11-16 11:38:30,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:30,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426530021] [2022-11-16 11:38:30,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:30,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:38:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:38:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:30,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:38:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 11:38:30,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:30,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426530021] [2022-11-16 11:38:30,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426530021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:30,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031416033] [2022-11-16 11:38:30,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:30,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:38:30,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:38:30,889 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:38:30,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:38:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:31,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-16 11:38:31,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:31,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-16 11:38:31,851 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_4848 (Array Int 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_4848)))) is different from true [2022-11-16 11:38:31,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:31,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-16 11:38:31,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-16 11:38:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-11-16 11:38:31,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:32,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4853 (Array Int Int)) (|v_node_create_~temp~0#1.base_66| Int)) (or (not (< |v_node_create_~temp~0#1.base_66| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_66| v_ArrVal_4853) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0)))) is different from false [2022-11-16 11:38:32,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031416033] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:32,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:32,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-16 11:38:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625143899] [2022-11-16 11:38:32,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:32,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:38:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:32,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:38:32,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-11-16 11:38:32,034 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:38:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:32,821 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-11-16 11:38:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:38:32,822 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2022-11-16 11:38:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:32,823 INFO L225 Difference]: With dead ends: 115 [2022-11-16 11:38:32,823 INFO L226 Difference]: Without dead ends: 115 [2022-11-16 11:38:32,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2022-11-16 11:38:32,824 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 304 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:32,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 496 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 434 Invalid, 0 Unknown, 76 Unchecked, 0.5s Time] [2022-11-16 11:38:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-16 11:38:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-16 11:38:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 108 states have internal predecessors, (119), 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-16 11:38:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-11-16 11:38:32,830 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 59 [2022-11-16 11:38:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:32,830 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-11-16 11:38:32,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:38:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-11-16 11:38:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 11:38:32,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:32,832 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] [2022-11-16 11:38:32,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:33,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 11:38:33,039 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:38:33,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 95034574, now seen corresponding path program 1 times [2022-11-16 11:38:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:33,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156514519] [2022-11-16 11:38:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:35,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:38:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:35,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:38:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:35,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:38:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:38:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:37,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156514519] [2022-11-16 11:38:37,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156514519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:37,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888115115] [2022-11-16 11:38:37,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:37,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:38:37,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:38:37,967 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:38:37,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:38:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:38,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-16 11:38:38,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:38,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:38:39,229 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:38:39,229 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 17 treesize of output 21 [2022-11-16 11:38:39,514 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 13 treesize of output 9 [2022-11-16 11:38:39,691 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:38:39,691 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 44 treesize of output 43 [2022-11-16 11:38:40,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:38:40,287 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 1 case distinctions, treesize of input 51 treesize of output 22 [2022-11-16 11:38:40,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:38:41,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:41,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:38:41,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:41,123 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:38:41,124 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 57 treesize of output 49 [2022-11-16 11:38:41,153 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:38:41,153 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-16 11:38:41,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:38:41,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:38:41,741 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 1 case distinctions, treesize of input 40 treesize of output 15 [2022-11-16 11:38:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:41,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:42,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888115115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:42,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:42,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 56 [2022-11-16 11:38:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075345197] [2022-11-16 11:38:42,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:42,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-16 11:38:42,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:42,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-16 11:38:42,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3368, Unknown=4, NotChecked=0, Total=3540 [2022-11-16 11:38:42,483 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:38:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:47,146 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2022-11-16 11:38:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:38:47,146 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 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 61 [2022-11-16 11:38:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:47,147 INFO L225 Difference]: With dead ends: 108 [2022-11-16 11:38:47,147 INFO L226 Difference]: Without dead ends: 108 [2022-11-16 11:38:47,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=398, Invalid=5760, Unknown=4, NotChecked=0, Total=6162 [2022-11-16 11:38:47,150 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 121 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:47,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1296 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1301 Invalid, 0 Unknown, 152 Unchecked, 1.5s Time] [2022-11-16 11:38:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-16 11:38:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-11-16 11:38:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.25) internal successors, (110), 101 states have internal predecessors, (110), 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-16 11:38:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2022-11-16 11:38:47,154 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 61 [2022-11-16 11:38:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:47,155 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-11-16 11:38:47,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:38:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2022-11-16 11:38:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 11:38:47,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:47,156 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-16 11:38:47,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:47,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 11:38:47,363 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:38:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:47,363 INFO L85 PathProgramCache]: Analyzing trace with hash 592087770, now seen corresponding path program 1 times [2022-11-16 11:38:47,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:47,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95975284] [2022-11-16 11:38:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:47,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:48,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:38:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:48,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:38:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:48,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:38:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:38:48,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:48,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95975284] [2022-11-16 11:38:48,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95975284] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892608925] [2022-11-16 11:38:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:48,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:38:48,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:38:48,947 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:38:48,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 11:38:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:49,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-16 11:38:49,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:49,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:38:50,067 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-16 11:38:50,208 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5413 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5413))) (exists ((v_ArrVal_5412 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5412)))) is different from true [2022-11-16 11:38:50,220 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5414 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5414))) (exists ((v_ArrVal_5412 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5412)))) is different from true [2022-11-16 11:38:50,230 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5415 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5415))) (exists ((v_ArrVal_5412 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5412)))) is different from true [2022-11-16 11:38:50,245 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5415 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5415) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5412 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_5412)))) is different from true [2022-11-16 11:38:50,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:50,264 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-16 11:38:50,286 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 11:38:50,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-16 11:38:51,102 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-16 11:38:51,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2022-11-16 11:38:51,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:51,121 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-16 11:38:51,238 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-16 11:38:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2022-11-16 11:38:51,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:54,436 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| Int) (v_ArrVal_5417 Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5418 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_5426))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| 1)) (.cse2 (select .cse1 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse3 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select .cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) 1)) (not (= (select .cse2 .cse3) 0)) (= (select .cse0 (select (select (store (store .cse1 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse2 .cse3 v_ArrVal_5417)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_5418) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| |c_#StackHeapBarrier|)))))) is different from false [2022-11-16 11:38:54,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892608925] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:54,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:54,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2022-11-16 11:38:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511534101] [2022-11-16 11:38:54,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:54,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-16 11:38:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:54,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-16 11:38:54,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2744, Unknown=6, NotChecked=550, Total=3540 [2022-11-16 11:38:54,441 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:38:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:56,348 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-11-16 11:38:56,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:38:56,349 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2022-11-16 11:38:56,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:56,350 INFO L225 Difference]: With dead ends: 113 [2022-11-16 11:38:56,350 INFO L226 Difference]: Without dead ends: 113 [2022-11-16 11:38:56,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=449, Invalid=4394, Unknown=7, NotChecked=700, Total=5550 [2022-11-16 11:38:56,353 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 82 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:56,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 797 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 856 Invalid, 0 Unknown, 355 Unchecked, 0.8s Time] [2022-11-16 11:38:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-16 11:38:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-11-16 11:38:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 101 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-16 11:38:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2022-11-16 11:38:56,358 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 63 [2022-11-16 11:38:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:56,359 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2022-11-16 11:38:56,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:38:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-11-16 11:38:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 11:38:56,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:56,360 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-16 11:38:56,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:38:56,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:38:56,568 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:38:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:56,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2060666116, now seen corresponding path program 1 times [2022-11-16 11:38:56,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:56,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098131938] [2022-11-16 11:38:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:56,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:38:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:58,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:38:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:59,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:38:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:39:00,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:00,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098131938] [2022-11-16 11:39:00,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098131938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:39:00,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375099191] [2022-11-16 11:39:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:00,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:39:00,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:39:00,010 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:39:00,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 11:39:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:00,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 149 conjunts are in the unsatisfiable core [2022-11-16 11:39:00,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:39:00,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:39:00,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:39:01,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:39:01,433 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:39:01,434 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 17 treesize of output 21 [2022-11-16 11:39:01,743 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 19 treesize of output 11 [2022-11-16 11:39:01,893 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 13 treesize of output 9 [2022-11-16 11:39:01,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:01,905 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-16 11:39:02,131 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:39:02,131 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 57 treesize of output 54 [2022-11-16 11:39:02,142 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 20 treesize of output 22 [2022-11-16 11:39:02,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:39:02,813 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 1 case distinctions, treesize of input 71 treesize of output 34 [2022-11-16 11:39:02,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:39:02,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:39:03,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:03,484 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 11:39:03,485 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 60 [2022-11-16 11:39:03,510 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-16 11:39:03,510 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 20 treesize of output 23 [2022-11-16 11:39:03,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:39:03,563 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:39:03,563 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-16 11:39:03,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:03,594 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 16 treesize of output 11 [2022-11-16 11:39:05,332 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-16 11:39:05,332 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 173 treesize of output 124 [2022-11-16 11:39:05,369 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 11:39:05,369 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 69 treesize of output 49 [2022-11-16 11:39:05,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:05,378 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 32 treesize of output 34 [2022-11-16 11:39:05,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:05,560 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:39:05,561 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 75 treesize of output 63 [2022-11-16 11:39:05,575 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-16 11:39:05,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:05,583 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 14 treesize of output 16 [2022-11-16 11:39:05,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:39:05,746 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 1 case distinctions, treesize of input 56 treesize of output 27 [2022-11-16 11:39:05,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:39:05,976 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-16 11:39:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:06,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:39:06,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5721 (Array Int Int)) (v_ArrVal_5720 (Array Int Int)) (v_ArrVal_5722 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5720) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5722) |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_dll_append_~new_last~0#1.base| v_ArrVal_5721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-16 11:39:08,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5721 (Array Int Int)) (v_ArrVal_5720 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| Int) (v_ArrVal_5722 (Array Int Int)) (v_ArrVal_5736 (Array Int Int)) (v_ArrVal_5735 (Array Int Int)) (v_ArrVal_5737 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_28| Int) (v_ArrVal_5718 (Array Int Int)) (v_ArrVal_5717 (Array Int Int)) (v_ArrVal_5719 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5737)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5736))) (let ((.cse1 (select (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_28| 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| |c_#StackHeapBarrier|)) (not (= 0 (select (select .cse0 .cse1) .cse2))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5735) .cse1 v_ArrVal_5718) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5720) (select (select (store (store .cse0 .cse1 v_ArrVal_5717) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_5719)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41|) 0)))))) is different from false [2022-11-16 11:39:08,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375099191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:39:08,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:39:08,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 66 [2022-11-16 11:39:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134248795] [2022-11-16 11:39:08,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:39:08,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-16 11:39:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:08,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-16 11:39:08,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=5082, Unknown=53, NotChecked=290, Total=5700 [2022-11-16 11:39:08,565 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 66 states, 64 states have (on average 1.6875) internal successors, (108), 57 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:39:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:39:20,405 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2022-11-16 11:39:20,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 11:39:20,406 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 1.6875) internal successors, (108), 57 states have internal predecessors, (108), 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 65 [2022-11-16 11:39:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:39:20,407 INFO L225 Difference]: With dead ends: 167 [2022-11-16 11:39:20,407 INFO L226 Difference]: Without dead ends: 167 [2022-11-16 11:39:20,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2504 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=961, Invalid=9908, Unknown=59, NotChecked=414, Total=11342 [2022-11-16 11:39:20,410 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1088 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:39:20,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 955 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-16 11:39:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-16 11:39:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 115. [2022-11-16 11:39:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 108 states have internal predecessors, (116), 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-16 11:39:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2022-11-16 11:39:20,415 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 65 [2022-11-16 11:39:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:39:20,415 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2022-11-16 11:39:20,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 1.6875) internal successors, (108), 57 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:39:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2022-11-16 11:39:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 11:39:20,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:39:20,417 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:20,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:39:20,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-16 11:39:20,625 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:39:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1337458320, now seen corresponding path program 1 times [2022-11-16 11:39:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:20,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627638583] [2022-11-16 11:39:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:23,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:39:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:39:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:39:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:39:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627638583] [2022-11-16 11:39:26,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627638583] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:39:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947965929] [2022-11-16 11:39:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:26,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:39:26,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:39:26,891 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:39:26,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:39:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:27,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-16 11:39:27,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:39:27,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:39:28,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:39:28,594 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:39:28,594 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 17 treesize of output 21 [2022-11-16 11:39:28,943 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 13 treesize of output 9 [2022-11-16 11:39:29,176 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:39:29,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-11-16 11:39:29,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:39:29,938 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 1 case distinctions, treesize of input 58 treesize of output 25 [2022-11-16 11:39:29,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:39:29,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:39:30,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:30,903 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:39:30,904 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 66 treesize of output 56 [2022-11-16 11:39:30,934 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:39:30,934 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-16 11:39:30,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:30,951 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 14 treesize of output 16 [2022-11-16 11:39:32,924 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-16 11:39:32,924 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 161 treesize of output 114 [2022-11-16 11:39:32,959 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 11:39:32,959 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 68 treesize of output 48 [2022-11-16 11:39:33,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:33,188 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:39:33,188 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 77 treesize of output 61 [2022-11-16 11:39:33,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:33,201 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 14 treesize of output 16 [2022-11-16 11:39:33,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:39:33,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:39:33,856 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 1 case distinctions, treesize of input 62 treesize of output 25 [2022-11-16 11:39:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:33,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:39:34,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6021 (Array Int Int)) (v_ArrVal_6020 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6021) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6020))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse1 4))) 1) (not (<= 0 .cse1))))) is different from false [2022-11-16 11:39:35,214 INFO L321 Elim1Store]: treesize reduction 5, result has 89.4 percent of original size [2022-11-16 11:39:35,215 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 51 treesize of output 50 [2022-11-16 11:39:37,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947965929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:39:37,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:39:37,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 69 [2022-11-16 11:39:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666793551] [2022-11-16 11:39:37,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:39:37,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-16 11:39:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:37,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-16 11:39:37,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=6531, Unknown=17, NotChecked=162, Total=6972 [2022-11-16 11:39:37,681 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 70 states, 67 states have (on average 1.791044776119403) internal successors, (120), 61 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:39:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:39:46,824 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2022-11-16 11:39:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 11:39:46,831 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 1.791044776119403) internal successors, (120), 61 states have internal predecessors, (120), 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-16 11:39:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:39:46,832 INFO L225 Difference]: With dead ends: 138 [2022-11-16 11:39:46,832 INFO L226 Difference]: Without dead ends: 138 [2022-11-16 11:39:46,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=576, Invalid=10541, Unknown=17, NotChecked=208, Total=11342 [2022-11-16 11:39:46,834 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 228 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:39:46,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1294 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2641 Invalid, 0 Unknown, 258 Unchecked, 3.4s Time] [2022-11-16 11:39:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-16 11:39:46,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2022-11-16 11:39:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2323232323232323) 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-16 11:39:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-11-16 11:39:46,839 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 68 [2022-11-16 11:39:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:39:46,840 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-11-16 11:39:46,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 1.791044776119403) internal successors, (120), 61 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:39:46,840 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-11-16 11:39:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 11:39:46,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:39:46,841 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:46,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:39:47,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-16 11:39:47,049 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:39:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:47,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1337458321, now seen corresponding path program 1 times [2022-11-16 11:39:47,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:47,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580602342] [2022-11-16 11:39:47,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:47,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:50,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:39:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:39:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:51,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:39:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:39:53,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:53,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580602342] [2022-11-16 11:39:53,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580602342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:39:53,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221652628] [2022-11-16 11:39:53,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:53,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:39:53,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:39:53,624 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:39:53,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 11:39:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:54,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-16 11:39:54,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:39:54,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:39:54,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:39:54,570 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:39:54,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:39:55,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:39:55,473 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 11:39:55,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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-16 11:39:55,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-16 11:39:55,871 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 13 treesize of output 9 [2022-11-16 11:39:56,130 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:39:56,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 70 [2022-11-16 11:39:56,139 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 41 treesize of output 41 [2022-11-16 11:39:57,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:39:57,019 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 1 case distinctions, treesize of input 101 treesize of output 48 [2022-11-16 11:39:57,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2022-11-16 11:39:57,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 11:39:58,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:58,077 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:39:58,077 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 107 treesize of output 85 [2022-11-16 11:39:58,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:58,115 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:39:58,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 11:39:58,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:58,129 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 48 treesize of output 47 [2022-11-16 11:39:58,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 32 [2022-11-16 11:40:00,290 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-16 11:40:00,290 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 183 treesize of output 130 [2022-11-16 11:40:00,325 INFO L321 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-11-16 11:40:00,326 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 83 treesize of output 62 [2022-11-16 11:40:00,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:00,569 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:40:00,569 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 105 treesize of output 83 [2022-11-16 11:40:00,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:00,581 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 48 treesize of output 47 [2022-11-16 11:40:01,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:40:01,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:01,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:40:01,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 57 [2022-11-16 11:40:01,726 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:40:01,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 25 [2022-11-16 11:40:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:40:02,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:40:11,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221652628] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:40:11,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:40:11,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 73 [2022-11-16 11:40:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435902814] [2022-11-16 11:40:11,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:40:11,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-16 11:40:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:11,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-16 11:40:11,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=7661, Unknown=44, NotChecked=0, Total=8010 [2022-11-16 11:40:11,454 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 74 states, 71 states have (on average 1.732394366197183) internal successors, (123), 65 states have internal predecessors, (123), 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-16 11:40:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:40:28,857 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-11-16 11:40:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 11:40:28,858 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 71 states have (on average 1.732394366197183) internal successors, (123), 65 states have internal predecessors, (123), 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 68 [2022-11-16 11:40:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:40:28,859 INFO L225 Difference]: With dead ends: 142 [2022-11-16 11:40:28,859 INFO L226 Difference]: Without dead ends: 142 [2022-11-16 11:40:28,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=987, Invalid=13488, Unknown=45, NotChecked=0, Total=14520 [2022-11-16 11:40:28,861 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 615 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 344 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:40:28,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1255 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2687 Invalid, 0 Unknown, 344 Unchecked, 4.0s Time] [2022-11-16 11:40:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-16 11:40:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2022-11-16 11:40:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 111 states have internal predecessors, (120), 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-16 11:40:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2022-11-16 11:40:28,867 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 68 [2022-11-16 11:40:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:40:28,867 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2022-11-16 11:40:28,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 71 states have (on average 1.732394366197183) internal successors, (123), 65 states have internal predecessors, (123), 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-16 11:40:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2022-11-16 11:40:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-16 11:40:28,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:40:28,869 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-16 11:40:28,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:40:29,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-16 11:40:29,077 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:40:29,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1488466325, now seen corresponding path program 1 times [2022-11-16 11:40:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:29,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024281103] [2022-11-16 11:40:29,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:40:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:40:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:32,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:40:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:40:33,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:33,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024281103] [2022-11-16 11:40:33,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024281103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:40:33,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601381518] [2022-11-16 11:40:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:33,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:40:33,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:40:33,293 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:40:33,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 11:40:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:33,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-16 11:40:33,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:40:33,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:40:33,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:40:34,207 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:40:34,208 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 17 treesize of output 21 [2022-11-16 11:40:34,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:40:34,857 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 11:40:34,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 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-16 11:40:35,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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-16 11:40:35,427 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:40:35,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-11-16 11:40:36,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:40:36,153 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 1 case distinctions, treesize of input 79 treesize of output 34 [2022-11-16 11:40:36,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 11:40:36,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:40:36,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:36,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:40:36,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:36,969 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:40:36,970 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 67 [2022-11-16 11:40:36,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:37,005 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:40:37,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 11:40:38,975 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-16 11:40:38,976 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 161 treesize of output 112 [2022-11-16 11:40:39,001 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 11:40:39,002 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 49 treesize of output 33 [2022-11-16 11:40:39,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:39,224 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:40:39,224 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 83 treesize of output 65 [2022-11-16 11:40:39,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:39,244 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 14 treesize of output 16 [2022-11-16 11:40:39,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:40:39,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:40:39,777 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 1 case distinctions, treesize of input 68 treesize of output 27 [2022-11-16 11:40:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:40:39,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:40:40,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 (Array Int Int)) (v_ArrVal_6617 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6618) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6617))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse1 4)) 0)) (not (<= 0 .cse1))))) is different from false [2022-11-16 11:40:40,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6614 Int) (v_ArrVal_6616 (Array Int Int)) (v_ArrVal_6618 (Array Int Int)) (v_ArrVal_6617 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_6614)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6618) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (not (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6616) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6617))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse0)) 0))))) is different from false [2022-11-16 11:40:42,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601381518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:40:42,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:40:42,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 69 [2022-11-16 11:40:42,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057131586] [2022-11-16 11:40:42,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:40:42,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-16 11:40:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:42,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-16 11:40:42,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=6163, Unknown=12, NotChecked=318, Total=6806 [2022-11-16 11:40:42,476 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 69 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 60 states have internal predecessors, (121), 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-16 11:40:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:40:48,441 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2022-11-16 11:40:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 11:40:48,442 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 60 states have internal predecessors, (121), 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-16 11:40:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:40:48,443 INFO L225 Difference]: With dead ends: 119 [2022-11-16 11:40:48,443 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 11:40:48,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2538 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=609, Invalid=9689, Unknown=12, NotChecked=402, Total=10712 [2022-11-16 11:40:48,444 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 181 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:40:48,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1139 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1752 Invalid, 0 Unknown, 147 Unchecked, 2.0s Time] [2022-11-16 11:40:48,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 11:40:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2022-11-16 11:40:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 110 states have internal predecessors, (118), 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-16 11:40:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2022-11-16 11:40:48,448 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 69 [2022-11-16 11:40:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:40:48,448 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2022-11-16 11:40:48,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 60 states have internal predecessors, (121), 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-16 11:40:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2022-11-16 11:40:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-16 11:40:48,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:40:48,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:40:48,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:40:48,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-16 11:40:48,655 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:40:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:48,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1102226234, now seen corresponding path program 1 times [2022-11-16 11:40:48,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:48,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62875809] [2022-11-16 11:40:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:48,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:51,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:40:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:40:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:52,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:40:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:40:54,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:54,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62875809] [2022-11-16 11:40:54,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62875809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:40:54,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949275034] [2022-11-16 11:40:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:54,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:40:54,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:40:54,928 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:40:54,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 11:40:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:55,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 179 conjunts are in the unsatisfiable core [2022-11-16 11:40:55,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:40:55,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:40:55,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:40:56,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:56,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 11:40:56,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:40:56,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:40:57,220 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:40:57,221 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 17 treesize of output 21 [2022-11-16 11:40:57,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:40:57,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:40:57,659 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 13 treesize of output 9 [2022-11-16 11:40:57,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:40:57,702 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 13 treesize of output 9 [2022-11-16 11:40:57,981 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:40:57,982 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 101 treesize of output 92 [2022-11-16 11:40:57,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:57,995 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 45 treesize of output 38 [2022-11-16 11:40:58,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:40:58,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:40:58,951 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 1 case distinctions, treesize of input 86 treesize of output 41 [2022-11-16 11:40:58,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:40:58,964 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 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:40:58,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:40:58,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:40:59,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:59,871 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 11:40:59,871 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 94 treesize of output 69 [2022-11-16 11:40:59,898 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-16 11:40:59,898 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 24 treesize of output 31 [2022-11-16 11:40:59,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:40:59,952 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:40:59,952 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-16 11:40:59,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:40:59,975 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:40:59,975 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 1 case distinctions, treesize of input 27 treesize of output 25 [2022-11-16 11:41:02,360 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-16 11:41:02,360 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 226 treesize of output 163 [2022-11-16 11:41:02,436 INFO L321 Elim1Store]: treesize reduction 136, result has 13.9 percent of original size [2022-11-16 11:41:02,437 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 91 [2022-11-16 11:41:02,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:41:02,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:02,455 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 57 treesize of output 42 [2022-11-16 11:41:02,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:41:02,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:02,715 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:41:02,716 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 96 treesize of output 78 [2022-11-16 11:41:02,729 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 22 treesize of output 24 [2022-11-16 11:41:02,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:02,743 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:41:02,744 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 1 case distinctions, treesize of input 31 treesize of output 34 [2022-11-16 11:41:03,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:41:03,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:03,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:41:03,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 56 [2022-11-16 11:41:03,827 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:41:03,828 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 1 case distinctions, treesize of input 34 treesize of output 15 [2022-11-16 11:41:04,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:41:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:41:04,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:41:04,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6931 (Array Int Int)) (v_ArrVal_6930 (Array Int Int)) (v_ArrVal_6932 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6932))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6930))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6931) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (not (<= 0 .cse4)))))) is different from false [2022-11-16 11:41:09,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6928 Int) (v_ArrVal_6925 Int) (v_ArrVal_6931 (Array Int Int)) (v_ArrVal_6930 (Array Int Int)) (v_ArrVal_6932 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| Int) (v_ArrVal_6946 (Array Int Int)) (v_ArrVal_6945 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_38| Int) (v_ArrVal_6947 (Array Int Int)) (v_ArrVal_6927 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6946)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6947))) (let ((.cse10 (select (select .cse8 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (+ (select (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select .cse8 .cse10) .cse11)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_38| 4))) (let ((.cse6 (store (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 v_ArrVal_6928)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6932))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store .cse8 .cse1 v_ArrVal_6927) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6930))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse7 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6945))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_6925))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6931) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (= (select (select .cse8 .cse1) .cse2) 0)) (not (<= 0 .cse7)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_38| (select (select .cse9 .cse10) .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53|) 0))))))))) is different from false [2022-11-16 11:41:09,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949275034] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:41:09,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:41:09,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 71 [2022-11-16 11:41:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780290832] [2022-11-16 11:41:09,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:41:09,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-16 11:41:09,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-16 11:41:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=6484, Unknown=23, NotChecked=326, Total=7140 [2022-11-16 11:41:09,682 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 71 states, 69 states have (on average 1.710144927536232) internal successors, (118), 62 states have internal predecessors, (118), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:41:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:41:16,082 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-11-16 11:41:16,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 11:41:16,082 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 69 states have (on average 1.710144927536232) internal successors, (118), 62 states have internal predecessors, (118), 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 70 [2022-11-16 11:41:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:41:16,083 INFO L225 Difference]: With dead ends: 123 [2022-11-16 11:41:16,084 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 11:41:16,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2315 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=587, Invalid=10316, Unknown=25, NotChecked=414, Total=11342 [2022-11-16 11:41:16,085 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 168 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:41:16,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1165 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1784 Invalid, 0 Unknown, 103 Unchecked, 2.6s Time] [2022-11-16 11:41:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 11:41:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2022-11-16 11:41:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.21) internal successors, (121), 113 states have internal predecessors, (121), 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-16 11:41:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2022-11-16 11:41:16,090 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 70 [2022-11-16 11:41:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:41:16,096 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2022-11-16 11:41:16,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 69 states have (on average 1.710144927536232) internal successors, (118), 62 states have internal predecessors, (118), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:41:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2022-11-16 11:41:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:41:16,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:41:16,098 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:16,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-16 11:41:16,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-16 11:41:16,306 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:41:16,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1397517466, now seen corresponding path program 2 times [2022-11-16 11:41:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:16,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150528902] [2022-11-16 11:41:16,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:16,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:41:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:19,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:41:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:20,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:41:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:41:20,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:20,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150528902] [2022-11-16 11:41:20,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150528902] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:41:20,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466340125] [2022-11-16 11:41:20,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:41:20,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:41:20,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:41:20,969 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:41:20,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 11:41:21,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:41:21,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:41:21,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 178 conjunts are in the unsatisfiable core [2022-11-16 11:41:21,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:41:21,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:41:21,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:41:21,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:41:21,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-16 11:41:22,165 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:41:22,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:41:22,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:41:22,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:41:22,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-16 11:41:23,156 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:41:23,156 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 16 treesize of output 18 [2022-11-16 11:41:23,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-16 11:41:23,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-16 11:41:23,685 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 13 treesize of output 9 [2022-11-16 11:41:23,959 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:41:23,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-11-16 11:41:23,975 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 22 treesize of output 24 [2022-11-16 11:41:24,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:41:24,867 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 1 case distinctions, treesize of input 78 treesize of output 37 [2022-11-16 11:41:24,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2022-11-16 11:41:24,891 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-16 11:41:24,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:41:26,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:26,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:41:26,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:26,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:26,035 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-16 11:41:26,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:26,088 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:41:26,089 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 84 treesize of output 70 [2022-11-16 11:41:26,138 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:41:26,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:41:27,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:27,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 13 treesize of output 9 [2022-11-16 11:41:28,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:28,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:41:28,507 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-11-16 11:41:28,508 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 207 treesize of output 99 [2022-11-16 11:41:28,565 INFO L321 Elim1Store]: treesize reduction 112, result has 17.0 percent of original size [2022-11-16 11:41:28,566 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 78 [2022-11-16 11:41:28,843 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 11:41:28,843 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 250 treesize of output 185 [2022-11-16 11:41:28,882 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-16 11:41:28,882 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 195 treesize of output 163 [2022-11-16 11:41:30,193 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:41:30,193 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 195 treesize of output 117 [2022-11-16 11:41:30,779 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:41:30,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 44 [2022-11-16 11:41:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 32 refuted. 7 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:41:30,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:41:31,605 INFO L321 Elim1Store]: treesize reduction 5, result has 92.1 percent of original size [2022-11-16 11:41:31,605 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 67 treesize of output 66 [2022-11-16 11:41:31,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 (Array Int Int)) (v_ArrVal_7238 (Array Int Int)) (v_ArrVal_7237 Int)) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5 v_ArrVal_7237)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7239))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7238))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ 4 (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse4))))))) is different from false [2022-11-16 11:41:35,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466340125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:41:35,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:41:35,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 74 [2022-11-16 11:41:35,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306745752] [2022-11-16 11:41:35,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:41:35,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-16 11:41:35,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:35,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-16 11:41:35,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=7536, Unknown=35, NotChecked=174, Total=8010 [2022-11-16 11:41:35,834 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 75 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 66 states have internal predecessors, (130), 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-16 11:41:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:41:42,673 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-11-16 11:41:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 11:41:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 66 states have internal predecessors, (130), 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 73 [2022-11-16 11:41:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:41:42,675 INFO L225 Difference]: With dead ends: 143 [2022-11-16 11:41:42,676 INFO L226 Difference]: Without dead ends: 143 [2022-11-16 11:41:42,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2332 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=545, Invalid=11853, Unknown=38, NotChecked=220, Total=12656 [2022-11-16 11:41:42,677 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 113 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 506 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:41:42,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1472 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2356 Invalid, 0 Unknown, 506 Unchecked, 2.8s Time] [2022-11-16 11:41:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-16 11:41:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-11-16 11:41:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 117 states have internal predecessors, (127), 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-16 11:41:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2022-11-16 11:41:42,686 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 73 [2022-11-16 11:41:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:41:42,686 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2022-11-16 11:41:42,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 66 states have internal predecessors, (130), 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-16 11:41:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2022-11-16 11:41:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:41:42,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:41:42,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:41:42,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-16 11:41:42,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:41:42,890 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:41:42,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:41:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1397517467, now seen corresponding path program 2 times [2022-11-16 11:41:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:41:42,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626797309] [2022-11-16 11:41:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:41:42,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:41:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:47,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:41:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:41:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:47,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:41:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:41:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:41:48,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:41:48,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626797309] [2022-11-16 11:41:48,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626797309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:41:48,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695909376] [2022-11-16 11:41:48,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:41:48,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:41:48,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:41:48,729 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:41:48,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 11:41:49,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:41:49,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:41:49,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 186 conjunts are in the unsatisfiable core [2022-11-16 11:41:49,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:41:49,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:41:49,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:41:49,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:41:49,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:41:50,002 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:41:50,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:41:50,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:41:50,588 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-16 11:41:50,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:41:50,961 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:41:50,962 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:41:50,997 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:41:50,997 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 11:41:51,556 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 13 treesize of output 9 [2022-11-16 11:41:51,565 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 13 treesize of output 9 [2022-11-16 11:41:51,819 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:41:51,819 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 56 treesize of output 53 [2022-11-16 11:41:51,832 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 22 treesize of output 24 [2022-11-16 11:41:52,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:41:52,836 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 1 case distinctions, treesize of input 83 treesize of output 42 [2022-11-16 11:41:52,844 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 9 treesize of output 7 [2022-11-16 11:41:52,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:41:52,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:41:52,865 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-16 11:41:54,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:54,161 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:41:54,161 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 89 treesize of output 75 [2022-11-16 11:41:54,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:54,175 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 20 treesize of output 22 [2022-11-16 11:41:54,208 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:41:54,208 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 28 treesize of output 30 [2022-11-16 11:41:54,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:54,236 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:41:54,236 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:41:56,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:41:56,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:41:57,001 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-11-16 11:41:57,001 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 196 treesize of output 97 [2022-11-16 11:41:57,070 INFO L321 Elim1Store]: treesize reduction 184, result has 10.7 percent of original size [2022-11-16 11:41:57,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 53 [2022-11-16 11:41:57,468 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 11:41:57,468 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 279 treesize of output 196 [2022-11-16 11:41:57,520 INFO L321 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2022-11-16 11:41:57,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 190 [2022-11-16 11:42:02,076 INFO L321 Elim1Store]: treesize reduction 184, result has 59.7 percent of original size [2022-11-16 11:42:02,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 495 treesize of output 489 [2022-11-16 11:42:03,171 INFO L321 Elim1Store]: treesize reduction 136, result has 64.3 percent of original size [2022-11-16 11:42:03,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 497 treesize of output 591 [2022-11-16 11:42:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:42:36,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:42:50,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695909376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:42:50,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:42:50,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 76 [2022-11-16 11:42:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425751998] [2022-11-16 11:42:50,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:42:50,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-16 11:42:50,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-16 11:42:50,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8668, Unknown=12, NotChecked=0, Total=8930 [2022-11-16 11:42:50,880 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 77 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 68 states have internal predecessors, (133), 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-16 11:43:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:05,340 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-11-16 11:43:05,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 11:43:05,340 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 68 states have internal predecessors, (133), 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 73 [2022-11-16 11:43:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:05,341 INFO L225 Difference]: With dead ends: 142 [2022-11-16 11:43:05,341 INFO L226 Difference]: Without dead ends: 142 [2022-11-16 11:43:05,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=539, Invalid=15448, Unknown=15, NotChecked=0, Total=16002 [2022-11-16 11:43:05,344 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 67 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 533 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:05,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1851 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2439 Invalid, 0 Unknown, 533 Unchecked, 3.3s Time] [2022-11-16 11:43:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-16 11:43:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2022-11-16 11:43:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 134 states have internal predecessors, (145), 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-16 11:43:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2022-11-16 11:43:05,350 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 73 [2022-11-16 11:43:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:05,350 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2022-11-16 11:43:05,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 68 states have internal predecessors, (133), 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-16 11:43:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2022-11-16 11:43:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 11:43:05,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:05,352 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:05,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-16 11:43:05,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-16 11:43:05,561 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:43:05,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash 373367201, now seen corresponding path program 2 times [2022-11-16 11:43:05,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:05,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944477308] [2022-11-16 11:43:05,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:05,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:43:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:09,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:43:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:09,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:43:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:43:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:11,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944477308] [2022-11-16 11:43:11,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944477308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:11,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997979501] [2022-11-16 11:43:11,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:43:11,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:11,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:11,554 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:43:11,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-16 11:43:12,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:43:12,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:43:12,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 143 conjunts are in the unsatisfiable core [2022-11-16 11:43:12,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:12,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:43:12,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:43:12,609 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:43:12,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:43:13,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:43:13,204 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:43:13,205 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-16 11:43:13,705 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 13 treesize of output 9 [2022-11-16 11:43:13,915 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:43:13,915 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 44 treesize of output 43 [2022-11-16 11:43:14,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:43:14,684 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 1 case distinctions, treesize of input 59 treesize of output 26 [2022-11-16 11:43:14,692 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-16 11:43:15,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:15,529 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-16 11:43:15,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:15,554 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 11:43:15,554 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 67 treesize of output 50 [2022-11-16 11:43:15,582 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:43:15,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:43:17,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:17,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:43:17,292 INFO L321 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2022-11-16 11:43:17,292 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 72 [2022-11-16 11:43:17,303 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 53 treesize of output 56 [2022-11-16 11:43:17,590 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 11:43:17,590 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 246 treesize of output 177 [2022-11-16 11:43:17,619 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-16 11:43:17,620 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 183 treesize of output 157 [2022-11-16 11:43:18,844 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 183 treesize of output 110 [2022-11-16 11:43:19,447 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-16 11:43:19,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 39 [2022-11-16 11:43:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:43:19,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:43:20,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7840 (Array Int Int)) (v_ArrVal_7841 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7841))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7840))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (not (<= 0 .cse4)))))) is different from false [2022-11-16 11:43:23,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997979501] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:23,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:43:23,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 68 [2022-11-16 11:43:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316871399] [2022-11-16 11:43:23,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:43:23,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-16 11:43:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-16 11:43:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=6243, Unknown=25, NotChecked=158, Total=6642 [2022-11-16 11:43:23,506 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 68 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 59 states have internal predecessors, (126), 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-16 11:43:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:35,757 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-11-16 11:43:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 11:43:35,757 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 59 states have internal predecessors, (126), 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 74 [2022-11-16 11:43:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:35,758 INFO L225 Difference]: With dead ends: 149 [2022-11-16 11:43:35,759 INFO L226 Difference]: Without dead ends: 149 [2022-11-16 11:43:35,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=699, Invalid=10836, Unknown=25, NotChecked=212, Total=11772 [2022-11-16 11:43:35,761 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 434 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 3202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:35,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 2030 Invalid, 3202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2898 Invalid, 0 Unknown, 249 Unchecked, 3.8s Time] [2022-11-16 11:43:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-16 11:43:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2022-11-16 11:43:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.1818181818181819) internal successors, (143), 134 states have internal predecessors, (143), 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-16 11:43:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2022-11-16 11:43:35,767 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 74 [2022-11-16 11:43:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:35,767 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2022-11-16 11:43:35,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 59 states have internal predecessors, (126), 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-16 11:43:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-11-16 11:43:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 11:43:35,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:35,769 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:35,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:35,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-16 11:43:35,975 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:43:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash 345185237, now seen corresponding path program 3 times [2022-11-16 11:43:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:35,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453615579] [2022-11-16 11:43:35,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:43:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:36,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:43:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:36,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:43:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:36,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-16 11:43:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-16 11:43:36,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:36,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453615579] [2022-11-16 11:43:36,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453615579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:36,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452769520] [2022-11-16 11:43:36,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:43:36,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:36,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:36,147 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:43:36,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-16 11:43:37,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 11:43:37,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:43:37,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 139 conjunts are in the unsatisfiable core [2022-11-16 11:43:37,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:37,461 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-16 11:43:37,545 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-16 11:43:37,546 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 37 treesize of output 27 [2022-11-16 11:43:38,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:38,041 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:43:38,041 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 29 treesize of output 35 [2022-11-16 11:43:38,085 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-16 11:43:38,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-11-16 11:43:38,300 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:43:38,300 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 37 treesize of output 41 [2022-11-16 11:43:38,420 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-11-16 11:43:38,420 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 44 treesize of output 41 [2022-11-16 11:43:38,446 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 13 treesize of output 9 [2022-11-16 11:43:38,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:38,667 INFO L321 Elim1Store]: treesize reduction 106, result has 23.7 percent of original size [2022-11-16 11:43:38,668 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 119 treesize of output 88 [2022-11-16 11:43:38,683 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 77 treesize of output 77 [2022-11-16 11:43:39,315 INFO L321 Elim1Store]: treesize reduction 70, result has 13.6 percent of original size [2022-11-16 11:43:39,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 60 [2022-11-16 11:43:39,340 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:43:39,340 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 1 case distinctions, treesize of input 13 treesize of output 18 [2022-11-16 11:43:39,353 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:43:39,353 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 10 [2022-11-16 11:43:39,698 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_8214 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_8214))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_8213 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_8213))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-16 11:43:39,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:39,806 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-11-16 11:43:39,806 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 164 treesize of output 126 [2022-11-16 11:43:39,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:39,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:39,827 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:43:39,827 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 155 treesize of output 148 [2022-11-16 11:43:39,928 INFO L321 Elim1Store]: treesize reduction 202, result has 33.1 percent of original size [2022-11-16 11:43:39,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 117 [2022-11-16 11:43:40,935 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 11:43:40,935 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 1 case distinctions, treesize of input 223 treesize of output 164 [2022-11-16 11:43:41,442 INFO L321 Elim1Store]: treesize reduction 46, result has 31.3 percent of original size [2022-11-16 11:43:41,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 71 [2022-11-16 11:43:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 47 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-16 11:43:41,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:43:42,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452769520] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:42,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:43:42,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 33] total 38 [2022-11-16 11:43:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336222579] [2022-11-16 11:43:42,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:43:42,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 11:43:42,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:42,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 11:43:42,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1930, Unknown=3, NotChecked=88, Total=2162 [2022-11-16 11:43:42,758 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 11:43:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:44,067 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-11-16 11:43:44,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:43:44,068 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2022-11-16 11:43:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:44,069 INFO L225 Difference]: With dead ends: 84 [2022-11-16 11:43:44,069 INFO L226 Difference]: Without dead ends: 84 [2022-11-16 11:43:44,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=232, Invalid=3306, Unknown=6, NotChecked=116, Total=3660 [2022-11-16 11:43:44,070 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 17 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 501 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:44,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 705 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 501 Unchecked, 0.2s Time] [2022-11-16 11:43:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-16 11:43:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-16 11:43:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 79 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-16 11:43:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-11-16 11:43:44,074 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 75 [2022-11-16 11:43:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:44,075 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-11-16 11:43:44,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 11:43:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-11-16 11:43:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 11:43:44,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:44,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:44,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-16 11:43:44,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-16 11:43:44,286 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:43:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:44,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1310476604, now seen corresponding path program 2 times [2022-11-16 11:43:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:44,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596223824] [2022-11-16 11:43:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:48,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:43:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:43:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:49,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:43:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:43:51,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:51,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596223824] [2022-11-16 11:43:51,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596223824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:51,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584978642] [2022-11-16 11:43:51,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:43:51,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:51,015 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:43:51,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-16 11:43:51,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:43:51,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:43:51,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-16 11:43:51,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:53,254 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-16 11:43:53,259 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-16 11:43:53,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:43:53,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:43:54,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:54,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-11-16 11:43:54,161 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:43:54,161 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-16 11:43:54,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:54,193 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-16 11:43:56,447 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 11:43:56,447 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 21 treesize of output 30 [2022-11-16 11:43:56,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:56,512 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-16 11:43:56,513 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 55 treesize of output 52 [2022-11-16 11:43:56,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:56,577 INFO L321 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-11-16 11:43:56,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 65 [2022-11-16 11:43:56,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:56,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:56,947 INFO L321 Elim1Store]: treesize reduction 55, result has 11.3 percent of original size [2022-11-16 11:43:56,947 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 7 new quantified variables, introduced 4 case distinctions, treesize of input 533 treesize of output 170 [2022-11-16 11:43:56,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:57,008 INFO L321 Elim1Store]: treesize reduction 80, result has 25.2 percent of original size [2022-11-16 11:43:57,008 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 7 new quantified variables, introduced 4 case distinctions, treesize of input 485 treesize of output 274 [2022-11-16 11:43:57,046 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 193 treesize of output 158 [2022-11-16 11:44:02,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:44:03,405 INFO L321 Elim1Store]: treesize reduction 56, result has 84.5 percent of original size [2022-11-16 11:44:03,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 643 treesize of output 524 [2022-11-16 11:44:03,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:44:04,222 INFO L321 Elim1Store]: treesize reduction 50, result has 81.0 percent of original size [2022-11-16 11:44:04,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 593 treesize of output 564 [2022-11-16 11:46:42,634 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-16 11:46:42,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 25 [2022-11-16 11:46:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:46:42,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:52,194 INFO L321 Elim1Store]: treesize reduction 4, result has 99.9 percent of original size [2022-11-16 11:46:52,195 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 133436 treesize of output 129311 [2022-11-16 11:47:10,155 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse21 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|))) (let ((.cse22 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse1056 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse1053 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse1057 (select (select .cse1053 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1058 (+ (select (select .cse1056 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1055 (select (select .cse1056 .cse1057) .cse1058))) (let ((.cse1046 (+ .cse1055 4)) (.cse1052 (select (select .cse1053 .cse1057) .cse1058))) (let ((.cse1045 (select .cse1053 .cse1052)) (.cse1048 (let ((.cse1054 (store .cse1056 .cse1052 (store (select .cse1056 .cse1052) .cse1046 0)))) (store .cse1054 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1054 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1055))))) (let ((.cse1042 (select (select .cse1048 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1047 (let ((.cse1051 (store .cse1053 .cse1052 (store .cse1045 .cse1046 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse1051 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1051 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1052))))) (let ((.cse1049 (select (select .cse1047 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1050 (+ .cse1042 4))) (let ((.cse1043 (select (select .cse1047 .cse1049) .cse1050)) (.cse1044 (select (select .cse1048 .cse1049) .cse1050))) (let ((.cse1041 (select (select .cse1047 .cse1043) (+ 4 .cse1044)))) (or (= .cse1041 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse1042)) (= .cse1041 .cse1043) (= .cse1044 0) (not (= (select .cse1045 .cse1046) 0)) (not (<= 0 .cse1046)) (not (<= 0 .cse1044)))))))))))))))) (.cse0 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse1038 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse1035 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse1039 (select (select .cse1035 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1040 (+ (select (select .cse1038 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1037 (select (select .cse1038 .cse1039) .cse1040))) (let ((.cse1027 (+ .cse1037 4)) (.cse1034 (select (select .cse1035 .cse1039) .cse1040))) (let ((.cse1026 (select .cse1035 .cse1034)) (.cse1030 (let ((.cse1036 (store .cse1038 .cse1034 (store (select .cse1038 .cse1034) .cse1027 0)))) (store .cse1036 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1036 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1037))))) (let ((.cse1025 (select (select .cse1030 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1029 (let ((.cse1033 (store .cse1035 .cse1034 (store .cse1026 .cse1027 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse1033 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1033 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1034))))) (let ((.cse1031 (select (select .cse1029 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1032 (+ .cse1025 4))) (let ((.cse1023 (select (select .cse1029 .cse1031) .cse1032)) (.cse1028 (select (select .cse1030 .cse1031) .cse1032))) (let ((.cse1024 (select (select .cse1029 .cse1023) (+ 4 .cse1028)))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse1023) (= .cse1024 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse1025)) (= .cse1024 .cse1023) (not (= (select .cse1026 .cse1027) 0)) (not (<= 0 .cse1027)) (not (<= 0 .cse1028)))))))))))))))) (.cse277 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse1020 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse1017 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse1021 (select (select .cse1017 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1022 (+ (select (select .cse1020 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1019 (select (select .cse1020 .cse1021) .cse1022))) (let ((.cse1012 (+ .cse1019 4)) (.cse1016 (select (select .cse1017 .cse1021) .cse1022))) (let ((.cse1011 (select .cse1017 .cse1016)) (.cse1005 (let ((.cse1018 (store .cse1020 .cse1016 (store (select .cse1020 .cse1016) .cse1012 0)))) (store .cse1018 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1018 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1019))))) (let ((.cse1010 (select (select .cse1005 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1009 (let ((.cse1015 (store .cse1017 .cse1016 (store .cse1011 .cse1012 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse1015 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1015 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1016))))) (let ((.cse1013 (select (select .cse1009 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1014 (+ .cse1010 4))) (let ((.cse1008 (select (select .cse1005 .cse1013) .cse1014))) (let ((.cse1006 (select (select .cse1009 .cse1013) .cse1014)) (.cse1007 (+ 4 .cse1008))) (or (= (select (select .cse1005 .cse1006) .cse1007) .cse1008) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse1006) (= (select (select .cse1009 .cse1006) .cse1007) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse1010)) (not (= (select .cse1011 .cse1012) 0)) (not (<= 0 .cse1012)) (not (<= 0 .cse1008)))))))))))))))) (.cse368 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse1002 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse999 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse1003 (select (select .cse999 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1004 (+ (select (select .cse1002 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1001 (select (select .cse1002 .cse1003) .cse1004))) (let ((.cse994 (+ .cse1001 4)) (.cse998 (select (select .cse999 .cse1003) .cse1004))) (let ((.cse993 (select .cse999 .cse998)) (.cse987 (let ((.cse1000 (store .cse1002 .cse998 (store (select .cse1002 .cse998) .cse994 0)))) (store .cse1000 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1000 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1001))))) (let ((.cse992 (select (select .cse987 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse991 (let ((.cse997 (store .cse999 .cse998 (store .cse993 .cse994 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse997 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse997 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse998))))) (let ((.cse995 (select (select .cse991 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse996 (+ .cse992 4))) (let ((.cse990 (select (select .cse987 .cse995) .cse996))) (let ((.cse988 (select (select .cse991 .cse995) .cse996)) (.cse989 (+ 4 .cse990))) (or (= (select (select .cse987 .cse988) .cse989) .cse990) (= (select (select .cse991 .cse988) .cse989) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse992)) (= .cse990 0) (not (= (select .cse993 .cse994) 0)) (not (<= 0 .cse994)) (not (<= 0 .cse990))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0))))) (.cse787 (not .cse21))) (and .cse0 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse19 (select (select .cse15 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse20 (+ (select (select .cse18 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse17 (select (select .cse18 .cse19) .cse20))) (let ((.cse7 (+ .cse17 4)) (.cse8 (select (select .cse15 .cse19) .cse20))) (let ((.cse6 (select .cse15 .cse8)) (.cse11 (let ((.cse16 (store .cse18 .cse8 (store (select .cse18 .cse8) .cse7 0)))) (store .cse16 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse16 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse17))))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (let ((.cse14 (store .cse15 .cse8 (store .cse6 .cse7 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse14 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse14 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse8))))) (let ((.cse12 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse5 4))) (let ((.cse2 (select (select .cse11 .cse12) .cse13))) (let ((.cse3 (select (select .cse9 .cse12) .cse13)) (.cse10 (+ 4 .cse2))) (let ((.cse1 (select (select .cse11 .cse3) .cse10)) (.cse4 (select (select .cse9 .cse3) .cse10))) (or (= .cse1 .cse2) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse3) (= .cse4 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse5)) (not (= (select .cse6 .cse7) 0)) (not (= .cse1 .cse7)) (not (<= 0 .cse7)) (not (<= 0 .cse2)) (not (= .cse4 .cse8)))))))))))))))) (or .cse21 (and .cse22 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse35 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse39 (select (select .cse35 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse40 (+ (select (select .cse38 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse37 (select (select .cse38 .cse39) .cse40))) (let ((.cse30 (+ .cse37 4)) (.cse34 (select (select .cse35 .cse39) .cse40))) (let ((.cse29 (select .cse35 .cse34)) (.cse23 (let ((.cse36 (store .cse38 .cse34 (store (select .cse38 .cse34) .cse30 0)))) (store .cse36 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse36 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse37))))) (let ((.cse26 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse27 (let ((.cse33 (store .cse35 .cse34 (store .cse29 .cse30 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse33 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse33 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse34))))) (let ((.cse31 (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (+ .cse26 4))) (let ((.cse28 (select (select .cse23 .cse31) .cse32))) (let ((.cse25 (+ 4 .cse28)) (.cse24 (select (select .cse27 .cse31) .cse32))) (or (= (select (select .cse23 .cse24) .cse25) 8) (not (<= 0 .cse26)) (= (select (select .cse27 .cse24) .cse25) .cse24) (= .cse28 0) (not (= (select .cse29 .cse30) 0)) (not (<= 0 .cse30)) (not (<= 0 .cse28))))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse53 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse57 (select (select .cse53 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse58 (+ (select (select .cse56 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse55 (select (select .cse56 .cse57) .cse58))) (let ((.cse48 (+ .cse55 4)) (.cse49 (select (select .cse53 .cse57) .cse58))) (let ((.cse47 (select .cse53 .cse49)) (.cse41 (let ((.cse54 (store .cse56 .cse49 (store (select .cse56 .cse49) .cse48 0)))) (store .cse54 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse54 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse55))))) (let ((.cse46 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (let ((.cse52 (store .cse53 .cse49 (store .cse47 .cse48 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse52 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse52 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse49))))) (let ((.cse50 (select (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse51 (+ .cse46 4))) (let ((.cse44 (select (select .cse41 .cse50) .cse51))) (let ((.cse43 (+ 4 .cse44)) (.cse42 (select (select .cse45 .cse50) .cse51))) (or (= (select (select .cse41 .cse42) .cse43) .cse44) (= (select (select .cse45 .cse42) .cse43) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse46)) (not (= (select .cse47 .cse48) 0)) (not (<= 0 .cse48)) (not (= .cse48 .cse44)) (not (= .cse49 .cse42))))))))))))))) .cse22 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse74 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse71 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse75 (select (select .cse71 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse76 (+ (select (select .cse74 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse73 (select (select .cse74 .cse75) .cse76))) (let ((.cse66 (+ .cse73 4)) (.cse67 (select (select .cse71 .cse75) .cse76))) (let ((.cse65 (select .cse71 .cse67)) (.cse59 (let ((.cse72 (store .cse74 .cse67 (store (select .cse74 .cse67) .cse66 0)))) (store .cse72 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse72 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse73))))) (let ((.cse64 (select (select .cse59 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse63 (let ((.cse70 (store .cse71 .cse67 (store .cse65 .cse66 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse70 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse70 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse67))))) (let ((.cse68 (select (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (+ .cse64 4))) (let ((.cse62 (select (select .cse59 .cse68) .cse69))) (let ((.cse61 (+ 4 .cse62)) (.cse60 (select (select .cse63 .cse68) .cse69))) (or (= (select (select .cse59 .cse60) .cse61) .cse62) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse60) (= (select (select .cse63 .cse60) .cse61) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse64)) (not (= (select .cse65 .cse66) 0)) (not (<= 0 .cse66)) (not (= .cse66 .cse62)) (not (= .cse67 .cse60))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse92 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse89 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse93 (select (select .cse89 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse94 (+ (select (select .cse92 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse91 (select (select .cse92 .cse93) .cse94))) (let ((.cse82 (+ .cse91 4)) (.cse88 (select (select .cse89 .cse93) .cse94))) (let ((.cse81 (select .cse89 .cse88)) (.cse83 (let ((.cse90 (store .cse92 .cse88 (store (select .cse92 .cse88) .cse82 0)))) (store .cse90 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse90 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse91))))) (let ((.cse80 (select (select .cse83 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse86 (let ((.cse87 (store .cse89 .cse88 (store .cse81 .cse82 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse87 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse87 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse88))))) (let ((.cse84 (select (select .cse86 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse85 (+ .cse80 4))) (let ((.cse79 (select (select .cse86 .cse84) .cse85)) (.cse77 (select (select .cse83 .cse84) .cse85))) (let ((.cse78 (select (select .cse83 .cse79) (+ 4 .cse77)))) (or (= 8 .cse77) (= .cse78 .cse77) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse79) (not (<= 0 .cse80)) (= .cse78 0) (not (= (select .cse81 .cse82) 0)) (not (<= 0 .cse82)) (not (<= 0 .cse77))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse110 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse107 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse111 (select (select .cse107 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse112 (+ (select (select .cse110 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse109 (select (select .cse110 .cse111) .cse112))) (let ((.cse102 (+ .cse109 4)) (.cse106 (select (select .cse107 .cse111) .cse112))) (let ((.cse101 (select .cse107 .cse106)) (.cse97 (let ((.cse108 (store .cse110 .cse106 (store (select .cse110 .cse106) .cse102 0)))) (store .cse108 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse108 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse109))))) (let ((.cse96 (select (select .cse97 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse100 (let ((.cse105 (store .cse107 .cse106 (store .cse101 .cse102 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse105 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse105 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse106))))) (let ((.cse103 (select (select .cse100 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse104 (+ .cse96 4))) (let ((.cse95 (select (select .cse97 .cse103) .cse104))) (let ((.cse99 (+ 4 .cse95)) (.cse98 (select (select .cse100 .cse103) .cse104))) (or (= 8 .cse95) (not (<= 0 .cse96)) (= (select (select .cse97 .cse98) .cse99) 0) (= (select (select .cse100 .cse98) .cse99) .cse98) (= .cse95 0) (not (= (select .cse101 .cse102) 0)) (not (<= 0 .cse102)) (not (<= 0 .cse95))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse129 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse126 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse130 (select (select .cse126 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse131 (+ (select (select .cse129 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse128 (select (select .cse129 .cse130) .cse131))) (let ((.cse119 (+ .cse128 4)) (.cse125 (select (select .cse126 .cse130) .cse131))) (let ((.cse118 (select .cse126 .cse125)) (.cse121 (let ((.cse127 (store .cse129 .cse125 (store (select .cse129 .cse125) .cse119 0)))) (store .cse127 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse127 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse128))))) (let ((.cse115 (select (select .cse121 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse116 (let ((.cse124 (store .cse126 .cse125 (store .cse118 .cse119 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse124 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse124 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse125))))) (let ((.cse122 (select (select .cse116 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse123 (+ .cse115 4))) (let ((.cse120 (select (select .cse121 .cse122) .cse123))) (let ((.cse114 (select (select .cse116 .cse122) .cse123)) (.cse117 (+ 4 .cse120))) (let ((.cse113 (select (select .cse121 .cse114) .cse117))) (or (= .cse113 8) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse114) (not (<= 0 .cse115)) (= .cse113 0) (= (select (select .cse116 .cse114) .cse117) .cse114) (not (= (select .cse118 .cse119) 0)) (not (<= 0 .cse119)) (not (<= 0 .cse120)))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (or .cse21 (and .cse0 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse147 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse144 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse148 (select (select .cse144 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse149 (+ (select (select .cse147 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse146 (select (select .cse147 .cse148) .cse149))) (let ((.cse138 (+ .cse146 4)) (.cse143 (select (select .cse144 .cse148) .cse149))) (let ((.cse137 (select .cse144 .cse143)) (.cse132 (let ((.cse145 (store .cse147 .cse143 (store (select .cse147 .cse143) .cse138 0)))) (store .cse145 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse145 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse146))))) (let ((.cse135 (select (select .cse132 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse136 (let ((.cse142 (store .cse144 .cse143 (store .cse137 .cse138 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse142 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse142 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse143))))) (let ((.cse140 (select (select .cse136 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse141 (+ .cse135 4))) (let ((.cse139 (select (select .cse132 .cse140) .cse141))) (let ((.cse134 (+ 4 .cse139)) (.cse133 (select (select .cse136 .cse140) .cse141))) (or (= (select (select .cse132 .cse133) .cse134) 8) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse133) (not (<= 0 .cse135)) (= (select (select .cse136 .cse133) .cse134) .cse133) (not (= (select .cse137 .cse138) 0)) (not (<= 0 .cse138)) (not (<= 0 .cse139))))))))))))))))) (or .cse21 (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse161 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse165 (select (select .cse161 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse166 (+ (select (select .cse164 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse163 (select (select .cse164 .cse165) .cse166))) (let ((.cse155 (+ .cse163 4)) (.cse160 (select (select .cse161 .cse165) .cse166))) (let ((.cse154 (select .cse161 .cse160)) (.cse156 (let ((.cse162 (store .cse164 .cse160 (store (select .cse164 .cse160) .cse155 0)))) (store .cse162 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse162 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse163))))) (let ((.cse151 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse152 (let ((.cse159 (store .cse161 .cse160 (store .cse154 .cse155 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse159 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse159 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse160))))) (let ((.cse157 (select (select .cse152 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse158 (+ .cse151 4))) (let ((.cse150 (select (select .cse152 .cse157) .cse158)) (.cse153 (select (select .cse156 .cse157) .cse158))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse150) (not (<= 0 .cse151)) (= (select (select .cse152 .cse150) (+ 4 .cse153)) .cse150) (not (= (select .cse154 .cse155) 0)) (not (<= 0 .cse155)) (not (<= 0 .cse153))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse182 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse179 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse183 (select (select .cse179 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse184 (+ (select (select .cse182 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse181 (select (select .cse182 .cse183) .cse184))) (let ((.cse174 (+ .cse181 4)) (.cse175 (select (select .cse179 .cse183) .cse184))) (let ((.cse173 (select .cse179 .cse175)) (.cse169 (let ((.cse180 (store .cse182 .cse175 (store (select .cse182 .cse175) .cse174 0)))) (store .cse180 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse180 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse181))))) (let ((.cse168 (select (select .cse169 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse172 (let ((.cse178 (store .cse179 .cse175 (store .cse173 .cse174 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse178 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse178 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse175))))) (let ((.cse176 (select (select .cse172 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse177 (+ .cse168 4))) (let ((.cse167 (select (select .cse169 .cse176) .cse177))) (let ((.cse171 (+ 4 .cse167)) (.cse170 (select (select .cse172 .cse176) .cse177))) (or (= 8 .cse167) (not (<= 0 .cse168)) (= (select (select .cse169 .cse170) .cse171) 0) (= (select (select .cse172 .cse170) .cse171) .cse170) (not (= (select .cse173 .cse174) 0)) (not (<= 0 .cse174)) (not (= .cse174 .cse167)) (not (= .cse175 .cse170))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse200 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse197 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse201 (select (select .cse197 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse202 (+ (select (select .cse200 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse199 (select (select .cse200 .cse201) .cse202))) (let ((.cse190 (+ .cse199 4)) (.cse196 (select (select .cse197 .cse201) .cse202))) (let ((.cse189 (select .cse197 .cse196)) (.cse191 (let ((.cse198 (store .cse200 .cse196 (store (select .cse200 .cse196) .cse190 0)))) (store .cse198 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse198 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse199))))) (let ((.cse188 (select (select .cse191 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse194 (let ((.cse195 (store .cse197 .cse196 (store .cse189 .cse190 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse195 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse195 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse196))))) (let ((.cse192 (select (select .cse194 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse193 (+ .cse188 4))) (let ((.cse187 (select (select .cse194 .cse192) .cse193)) (.cse186 (select (select .cse191 .cse192) .cse193))) (let ((.cse185 (select (select .cse191 .cse187) (+ 4 .cse186)))) (or (= .cse185 .cse186) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse187) (not (<= 0 .cse188)) (= .cse185 0) (not (= (select .cse189 .cse190) 0)) (not (<= 0 .cse190)) (not (<= 0 .cse186))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse219 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse216 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse220 (select (select .cse216 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse221 (+ (select (select .cse219 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse218 (select (select .cse219 .cse220) .cse221))) (let ((.cse207 (+ .cse218 4)) (.cse211 (select (select .cse216 .cse220) .cse221))) (let ((.cse206 (select .cse216 .cse211)) (.cse208 (let ((.cse217 (store .cse219 .cse211 (store (select .cse219 .cse211) .cse207 0)))) (store .cse217 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse217 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse218))))) (let ((.cse205 (select (select .cse208 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse212 (let ((.cse215 (store .cse216 .cse211 (store .cse206 .cse207 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse215 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse215 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse211))))) (let ((.cse213 (select (select .cse212 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse214 (+ .cse205 4))) (let ((.cse210 (select (select .cse208 .cse213) .cse214))) (let ((.cse203 (select (select .cse212 .cse213) .cse214)) (.cse209 (+ 4 .cse210))) (let ((.cse204 (select (select .cse212 .cse203) .cse209))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse203) (= .cse204 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse205)) (= .cse204 .cse203) (not (= (select .cse206 .cse207) 0)) (not (= (select (select .cse208 .cse203) .cse209) .cse207)) (not (<= 0 .cse207)) (not (<= 0 .cse210)) (not (= .cse204 .cse211)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse239 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse236 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse240 (select (select .cse236 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse241 (+ (select (select .cse239 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse238 (select (select .cse239 .cse240) .cse241))) (let ((.cse227 (+ .cse238 4)) (.cse228 (select (select .cse236 .cse240) .cse241))) (let ((.cse226 (select .cse236 .cse228)) (.cse232 (let ((.cse237 (store .cse239 .cse228 (store (select .cse239 .cse228) .cse227 0)))) (store .cse237 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse237 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse238))))) (let ((.cse225 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse229 (let ((.cse235 (store .cse236 .cse228 (store .cse226 .cse227 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse235 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse235 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse228))))) (let ((.cse233 (select (select .cse229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse234 (+ .cse225 4))) (let ((.cse223 (select (select .cse232 .cse233) .cse234))) (let ((.cse230 (select (select .cse229 .cse233) .cse234)) (.cse231 (+ 4 .cse223))) (let ((.cse222 (select (select .cse232 .cse230) .cse231)) (.cse224 (select (select .cse229 .cse230) .cse231))) (or (= .cse222 .cse223) (= .cse224 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse225)) (= .cse223 0) (not (= (select .cse226 .cse227) 0)) (not (= .cse222 .cse227)) (not (<= 0 .cse227)) (not (<= 0 .cse223)) (not (= .cse224 .cse228)))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse256 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse253 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse257 (select (select .cse253 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse258 (+ (select (select .cse256 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse255 (select (select .cse256 .cse257) .cse258))) (let ((.cse246 (+ .cse255 4)) (.cse252 (select (select .cse253 .cse257) .cse258))) (let ((.cse245 (select .cse253 .cse252)) (.cse247 (let ((.cse254 (store .cse256 .cse252 (store (select .cse256 .cse252) .cse246 0)))) (store .cse254 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse254 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse255))))) (let ((.cse244 (select (select .cse247 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse248 (let ((.cse251 (store .cse253 .cse252 (store .cse245 .cse246 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse251 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse251 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse252))))) (let ((.cse249 (select (select .cse248 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse250 (+ .cse244 4))) (let ((.cse242 (select (select .cse247 .cse249) .cse250))) (let ((.cse243 (select (select .cse247 (select (select .cse248 .cse249) .cse250)) (+ 4 .cse242)))) (or (= 8 .cse242) (= .cse243 .cse242) (not (<= 0 .cse244)) (= .cse243 0) (= .cse242 0) (not (= (select .cse245 .cse246) 0)) (not (<= 0 .cse246)) (not (<= 0 .cse242))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse274 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse271 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse275 (select (select .cse271 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse276 (+ (select (select .cse274 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse273 (select (select .cse274 .cse275) .cse276))) (let ((.cse263 (+ .cse273 4)) (.cse265 (select (select .cse271 .cse275) .cse276))) (let ((.cse262 (select .cse271 .cse265)) (.cse267 (let ((.cse272 (store .cse274 .cse265 (store (select .cse274 .cse265) .cse263 0)))) (store .cse272 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse272 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse273))))) (let ((.cse260 (select (select .cse267 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse266 (let ((.cse270 (store .cse271 .cse265 (store .cse262 .cse263 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse270 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse270 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse265))))) (let ((.cse268 (select (select .cse266 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse269 (+ .cse260 4))) (let ((.cse261 (select (select .cse266 .cse268) .cse269)) (.cse264 (select (select .cse267 .cse268) .cse269))) (let ((.cse259 (select (select .cse266 .cse261) (+ 4 .cse264)))) (or (= .cse259 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse260)) (= .cse259 .cse261) (not (= (select .cse262 .cse263) 0)) (not (<= 0 .cse263)) (not (= .cse263 .cse264)) (not (= .cse265 .cse261))))))))))))))) (or .cse21 (and .cse277 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse293 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse290 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse294 (select (select .cse290 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse295 (+ (select (select .cse293 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse292 (select (select .cse293 .cse294) .cse295))) (let ((.cse283 (+ .cse292 4)) (.cse289 (select (select .cse290 .cse294) .cse295))) (let ((.cse282 (select .cse290 .cse289)) (.cse284 (let ((.cse291 (store .cse293 .cse289 (store (select .cse293 .cse289) .cse283 0)))) (store .cse291 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse291 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse292))))) (let ((.cse281 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse287 (let ((.cse288 (store .cse290 .cse289 (store .cse282 .cse283 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse288 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse288 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse289))))) (let ((.cse285 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse286 (+ .cse281 4))) (let ((.cse280 (select (select .cse287 .cse285) .cse286)) (.cse279 (select (select .cse284 .cse285) .cse286))) (let ((.cse278 (select (select .cse284 .cse280) (+ 4 .cse279)))) (or (= .cse278 8) (= .cse278 .cse279) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse280) (not (<= 0 .cse281)) (not (= (select .cse282 .cse283) 0)) (not (<= 0 .cse283)) (not (<= 0 .cse279))))))))))))))))) (or .cse21 (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse310 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse307 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse311 (select (select .cse307 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse312 (+ (select (select .cse310 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse309 (select (select .cse310 .cse311) .cse312))) (let ((.cse301 (+ .cse309 4)) (.cse302 (select (select .cse307 .cse311) .cse312))) (let ((.cse300 (select .cse307 .cse302)) (.cse297 (let ((.cse308 (store .cse310 .cse302 (store (select .cse310 .cse302) .cse301 0)))) (store .cse308 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse308 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse309))))) (let ((.cse299 (select (select .cse297 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse303 (let ((.cse306 (store .cse307 .cse302 (store .cse300 .cse301 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse306 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse306 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse302))))) (let ((.cse304 (select (select .cse303 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse305 (+ .cse299 4))) (let ((.cse296 (select (select .cse297 .cse304) .cse305)) (.cse298 (select (select .cse303 .cse304) .cse305))) (or (= 8 .cse296) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (= (select (select .cse297 .cse298) (+ 4 .cse296)) .cse296) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse299)) (not (= (select .cse300 .cse301) 0)) (not (<= 0 .cse301)) (not (= .cse301 .cse296)) (not (= .cse302 .cse298))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse330 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse327 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse331 (select (select .cse327 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse332 (+ (select (select .cse330 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse329 (select (select .cse330 .cse331) .cse332))) (let ((.cse319 (+ .cse329 4)) (.cse320 (select (select .cse327 .cse331) .cse332))) (let ((.cse318 (select .cse327 .cse320)) (.cse323 (let ((.cse328 (store .cse330 .cse320 (store (select .cse330 .cse320) .cse319 0)))) (store .cse328 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse328 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse329))))) (let ((.cse314 (select (select .cse323 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse321 (let ((.cse326 (store .cse327 .cse320 (store .cse318 .cse319 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse326 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse326 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse320))))) (let ((.cse324 (select (select .cse321 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse325 (+ .cse314 4))) (let ((.cse317 (select (select .cse323 .cse324) .cse325))) (let ((.cse316 (select (select .cse321 .cse324) .cse325)) (.cse322 (+ 4 .cse317))) (let ((.cse313 (select (select .cse323 .cse316) .cse322)) (.cse315 (select (select .cse321 .cse316) .cse322))) (or (= .cse313 8) (not (<= 0 .cse314)) (= .cse315 .cse316) (= .cse317 0) (not (= (select .cse318 .cse319) 0)) (not (= .cse313 .cse319)) (not (<= 0 .cse319)) (not (<= 0 .cse317)) (not (= .cse315 .cse320)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse348 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse345 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse349 (select (select .cse345 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse350 (+ (select (select .cse348 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse347 (select (select .cse348 .cse349) .cse350))) (let ((.cse339 (+ .cse347 4)) (.cse341 (select (select .cse345 .cse349) .cse350))) (let ((.cse338 (select .cse345 .cse341)) (.cse334 (let ((.cse346 (store .cse348 .cse341 (store (select .cse348 .cse341) .cse339 0)))) (store .cse346 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse346 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse347))))) (let ((.cse333 (select (select .cse334 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse337 (let ((.cse344 (store .cse345 .cse341 (store .cse338 .cse339 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse344 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse344 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse341))))) (let ((.cse342 (select (select .cse337 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse343 (+ .cse333 4))) (let ((.cse340 (select (select .cse334 .cse342) .cse343))) (let ((.cse336 (+ 4 .cse340)) (.cse335 (select (select .cse337 .cse342) .cse343))) (or (not (<= 0 .cse333)) (= (select (select .cse334 .cse335) .cse336) 0) (= (select (select .cse337 .cse335) .cse336) .cse335) (not (= (select .cse338 .cse339) 0)) (not (<= 0 .cse339)) (not (= .cse339 .cse340)) (not (= .cse341 .cse335))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (or .cse21 (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse365 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse362 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse366 (select (select .cse362 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse367 (+ (select (select .cse365 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse364 (select (select .cse365 .cse366) .cse367))) (let ((.cse356 (+ .cse364 4)) (.cse357 (select (select .cse362 .cse366) .cse367))) (let ((.cse355 (select .cse362 .cse357)) (.cse360 (let ((.cse363 (store .cse365 .cse357 (store (select .cse365 .cse357) .cse356 0)))) (store .cse363 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse363 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse364))))) (let ((.cse351 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse352 (let ((.cse361 (store .cse362 .cse357 (store .cse355 .cse356 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse361 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse361 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse357))))) (let ((.cse358 (select (select .cse352 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse359 (+ .cse351 4))) (let ((.cse354 (select (select .cse360 .cse358) .cse359)) (.cse353 (select (select .cse352 .cse358) .cse359))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse351)) (= (select (select .cse352 .cse353) (+ 4 .cse354)) .cse353) (not (= (select .cse355 .cse356) 0)) (not (<= 0 .cse356)) (not (= .cse356 .cse354)) (not (= .cse357 .cse353))))))))))))) (or .cse21 (and .cse368 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse383 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse380 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse384 (select (select .cse380 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse385 (+ (select (select .cse383 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse382 (select (select .cse383 .cse384) .cse385))) (let ((.cse373 (+ .cse382 4)) (.cse379 (select (select .cse380 .cse384) .cse385))) (let ((.cse372 (select .cse380 .cse379)) (.cse374 (let ((.cse381 (store .cse383 .cse379 (store (select .cse383 .cse379) .cse373 0)))) (store .cse381 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse381 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse382))))) (let ((.cse371 (select (select .cse374 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse375 (let ((.cse378 (store .cse380 .cse379 (store .cse372 .cse373 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse378 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse378 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse379))))) (let ((.cse376 (select (select .cse375 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse377 (+ .cse371 4))) (let ((.cse370 (select (select .cse374 .cse376) .cse377))) (let ((.cse369 (select (select .cse374 (select (select .cse375 .cse376) .cse377)) (+ 4 .cse370)))) (or (= .cse369 8) (= .cse369 .cse370) (not (<= 0 .cse371)) (= .cse370 0) (not (= (select .cse372 .cse373) 0)) (not (<= 0 .cse373)) (not (<= 0 .cse370))))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse402 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse399 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse403 (select (select .cse399 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse404 (+ (select (select .cse402 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse401 (select (select .cse402 .cse403) .cse404))) (let ((.cse390 (+ .cse401 4)) (.cse394 (select (select .cse399 .cse403) .cse404))) (let ((.cse389 (select .cse399 .cse394)) (.cse395 (let ((.cse400 (store .cse402 .cse394 (store (select .cse402 .cse394) .cse390 0)))) (store .cse400 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse400 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse401))))) (let ((.cse388 (select (select .cse395 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse391 (let ((.cse398 (store .cse399 .cse394 (store .cse389 .cse390 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse398 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse398 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse394))))) (let ((.cse396 (select (select .cse391 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse397 (+ .cse388 4))) (let ((.cse387 (select (select .cse395 .cse396) .cse397))) (let ((.cse392 (select (select .cse391 .cse396) .cse397)) (.cse393 (+ 4 .cse387))) (let ((.cse386 (select (select .cse395 .cse392) .cse393))) (or (= .cse386 8) (= .cse386 .cse387) (not (<= 0 .cse388)) (= .cse387 0) (not (= (select .cse389 .cse390) 0)) (not (= .cse386 .cse390)) (not (<= 0 .cse390)) (not (<= 0 .cse387)) (not (= (select (select .cse391 .cse392) .cse393) .cse394)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse420 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse417 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse421 (select (select .cse417 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse422 (+ (select (select .cse420 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse419 (select (select .cse420 .cse421) .cse422))) (let ((.cse411 (+ .cse419 4)) (.cse413 (select (select .cse417 .cse421) .cse422))) (let ((.cse410 (select .cse417 .cse413)) (.cse407 (let ((.cse418 (store .cse420 .cse413 (store (select .cse420 .cse413) .cse411 0)))) (store .cse418 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse418 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse419))))) (let ((.cse406 (select (select .cse407 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse409 (let ((.cse416 (store .cse417 .cse413 (store .cse410 .cse411 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse416 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse416 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse413))))) (let ((.cse414 (select (select .cse409 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse415 (+ .cse406 4))) (let ((.cse412 (select (select .cse407 .cse414) .cse415))) (let ((.cse408 (+ 4 .cse412)) (.cse405 (select (select .cse409 .cse414) .cse415))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse405) (not (<= 0 .cse406)) (= (select (select .cse407 .cse405) .cse408) 0) (= (select (select .cse409 .cse405) .cse408) .cse405) (not (= (select .cse410 .cse411) 0)) (not (<= 0 .cse411)) (not (= .cse411 .cse412)) (not (= .cse413 .cse405))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse438 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse435 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse439 (select (select .cse435 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse440 (+ (select (select .cse438 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse437 (select (select .cse438 .cse439) .cse440))) (let ((.cse428 (+ .cse437 4)) (.cse434 (select (select .cse435 .cse439) .cse440))) (let ((.cse427 (select .cse435 .cse434)) (.cse429 (let ((.cse436 (store .cse438 .cse434 (store (select .cse438 .cse434) .cse428 0)))) (store .cse436 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse436 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse437))))) (let ((.cse426 (select (select .cse429 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse432 (let ((.cse433 (store .cse435 .cse434 (store .cse427 .cse428 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse433 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse433 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse434))))) (let ((.cse430 (select (select .cse432 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse431 (+ .cse426 4))) (let ((.cse425 (select (select .cse432 .cse430) .cse431)) (.cse424 (select (select .cse429 .cse430) .cse431))) (let ((.cse423 (select (select .cse429 .cse425) (+ 4 .cse424)))) (or (= .cse423 8) (= .cse423 .cse424) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse425) (not (<= 0 .cse426)) (= .cse423 0) (not (= (select .cse427 .cse428) 0)) (not (<= 0 .cse428)) (not (<= 0 .cse424))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse456 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse453 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse457 (select (select .cse453 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse458 (+ (select (select .cse456 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse455 (select (select .cse456 .cse457) .cse458))) (let ((.cse448 (+ .cse455 4)) (.cse449 (select (select .cse453 .cse457) .cse458))) (let ((.cse447 (select .cse453 .cse449)) (.cse442 (let ((.cse454 (store .cse456 .cse449 (store (select .cse456 .cse449) .cse448 0)))) (store .cse454 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse454 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse455))))) (let ((.cse446 (select (select .cse442 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse445 (let ((.cse452 (store .cse453 .cse449 (store .cse447 .cse448 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse452 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse452 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse449))))) (let ((.cse450 (select (select .cse445 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse451 (+ .cse446 4))) (let ((.cse441 (select (select .cse442 .cse450) .cse451))) (let ((.cse444 (+ 4 .cse441)) (.cse443 (select (select .cse445 .cse450) .cse451))) (or (= 8 .cse441) (= (select (select .cse442 .cse443) .cse444) .cse441) (= (select (select .cse445 .cse443) .cse444) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse446)) (not (= (select .cse447 .cse448) 0)) (not (<= 0 .cse448)) (not (= .cse448 .cse441)) (not (= .cse449 .cse443))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse473 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse470 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse474 (select (select .cse470 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse475 (+ (select (select .cse473 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse472 (select (select .cse473 .cse474) .cse475))) (let ((.cse463 (+ .cse472 4)) (.cse469 (select (select .cse470 .cse474) .cse475))) (let ((.cse462 (select .cse470 .cse469)) (.cse464 (let ((.cse471 (store .cse473 .cse469 (store (select .cse473 .cse469) .cse463 0)))) (store .cse471 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse471 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse472))))) (let ((.cse461 (select (select .cse464 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse465 (let ((.cse468 (store .cse470 .cse469 (store .cse462 .cse463 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse468 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse468 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse469))))) (let ((.cse466 (select (select .cse465 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse467 (+ .cse461 4))) (let ((.cse460 (select (select .cse464 .cse466) .cse467))) (let ((.cse459 (select (select .cse464 (select (select .cse465 .cse466) .cse467)) (+ 4 .cse460)))) (or (= .cse459 8) (= .cse459 .cse460) (not (<= 0 .cse461)) (= .cse459 0) (= .cse460 0) (not (= (select .cse462 .cse463) 0)) (not (<= 0 .cse463)) (not (<= 0 .cse460))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse492 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse489 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse493 (select (select .cse489 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse494 (+ (select (select .cse492 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse491 (select (select .cse492 .cse493) .cse494))) (let ((.cse482 (+ .cse491 4)) (.cse488 (select (select .cse489 .cse493) .cse494))) (let ((.cse481 (select .cse489 .cse488)) (.cse479 (let ((.cse490 (store .cse492 .cse488 (store (select .cse492 .cse488) .cse482 0)))) (store .cse490 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse490 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse491))))) (let ((.cse478 (select (select .cse479 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse484 (let ((.cse487 (store .cse489 .cse488 (store .cse481 .cse482 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse487 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse487 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse488))))) (let ((.cse485 (select (select .cse484 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse486 (+ .cse478 4))) (let ((.cse483 (select (select .cse479 .cse485) .cse486))) (let ((.cse476 (select (select .cse484 .cse485) .cse486)) (.cse480 (+ 4 .cse483))) (let ((.cse477 (select (select .cse484 .cse476) .cse480))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse476) (= .cse477 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse478)) (= (select (select .cse479 .cse476) .cse480) 0) (= .cse477 .cse476) (not (= (select .cse481 .cse482) 0)) (not (<= 0 .cse482)) (not (<= 0 .cse483)))))))))))))))) (or .cse21 (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse509 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse506 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse510 (select (select .cse506 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse511 (+ (select (select .cse509 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse508 (select (select .cse509 .cse510) .cse511))) (let ((.cse500 (+ .cse508 4)) (.cse501 (select (select .cse506 .cse510) .cse511))) (let ((.cse499 (select .cse506 .cse501)) (.cse495 (let ((.cse507 (store .cse509 .cse501 (store (select .cse509 .cse501) .cse500 0)))) (store .cse507 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse507 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse508))))) (let ((.cse498 (select (select .cse495 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse502 (let ((.cse505 (store .cse506 .cse501 (store .cse499 .cse500 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse505 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse505 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse501))))) (let ((.cse503 (select (select .cse502 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse504 (+ .cse498 4))) (let ((.cse497 (select (select .cse495 .cse503) .cse504)) (.cse496 (select (select .cse502 .cse503) .cse504))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (= (select (select .cse495 .cse496) (+ 4 .cse497)) .cse497) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse496) (not (<= 0 .cse498)) (not (= (select .cse499 .cse500) 0)) (not (<= 0 .cse500)) (not (= .cse500 .cse497)) (not (= .cse501 .cse496))))))))))))) (or (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse526 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse523 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse527 (select (select .cse523 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse528 (+ (select (select .cse526 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse525 (select (select .cse526 .cse527) .cse528))) (let ((.cse517 (+ .cse525 4)) (.cse522 (select (select .cse523 .cse527) .cse528))) (let ((.cse516 (select .cse523 .cse522)) (.cse512 (let ((.cse524 (store .cse526 .cse522 (store (select .cse526 .cse522) .cse517 0)))) (store .cse524 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse524 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse525))))) (let ((.cse515 (select (select .cse512 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse520 (let ((.cse521 (store .cse523 .cse522 (store .cse516 .cse517 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse521 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse521 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse522))))) (let ((.cse518 (select (select .cse520 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse519 (+ .cse515 4))) (let ((.cse513 (select (select .cse520 .cse518) .cse519)) (.cse514 (select (select .cse512 .cse518) .cse519))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (= (select (select .cse512 .cse513) (+ 4 .cse514)) .cse514) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse513) (not (<= 0 .cse515)) (not (= (select .cse516 .cse517) 0)) (not (<= 0 .cse517)) (not (<= 0 .cse514)))))))))))) .cse21) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse545 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse542 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse546 (select (select .cse542 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse547 (+ (select (select .cse545 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse544 (select (select .cse545 .cse546) .cse547))) (let ((.cse534 (+ .cse544 4)) (.cse537 (select (select .cse542 .cse546) .cse547))) (let ((.cse533 (select .cse542 .cse537)) (.cse535 (let ((.cse543 (store .cse545 .cse537 (store (select .cse545 .cse537) .cse534 0)))) (store .cse543 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse543 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse544))))) (let ((.cse530 (select (select .cse535 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse538 (let ((.cse541 (store .cse542 .cse537 (store .cse533 .cse534 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse541 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse541 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse537))))) (let ((.cse539 (select (select .cse538 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse540 (+ .cse530 4))) (let ((.cse532 (select (select .cse535 .cse539) .cse540))) (let ((.cse531 (select (select .cse538 .cse539) .cse540)) (.cse536 (+ 4 .cse532))) (let ((.cse529 (select (select .cse538 .cse531) .cse536))) (or (= .cse529 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse530)) (= .cse529 .cse531) (= .cse532 0) (not (= (select .cse533 .cse534) 0)) (not (= (select (select .cse535 .cse531) .cse536) .cse534)) (not (<= 0 .cse534)) (not (<= 0 .cse532)) (not (= .cse529 .cse537)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse563 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse560 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse564 (select (select .cse560 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse565 (+ (select (select .cse563 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse562 (select (select .cse563 .cse564) .cse565))) (let ((.cse555 (+ .cse562 4)) (.cse559 (select (select .cse560 .cse564) .cse565))) (let ((.cse554 (select .cse560 .cse559)) (.cse551 (let ((.cse561 (store .cse563 .cse559 (store (select .cse563 .cse559) .cse555 0)))) (store .cse561 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse561 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse562))))) (let ((.cse550 (select (select .cse551 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse553 (let ((.cse558 (store .cse560 .cse559 (store .cse554 .cse555 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse558 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse558 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse559))))) (let ((.cse556 (select (select .cse553 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse557 (+ .cse550 4))) (let ((.cse548 (select (select .cse551 .cse556) .cse557))) (let ((.cse552 (+ 4 .cse548)) (.cse549 (select (select .cse553 .cse556) .cse557))) (or (= 8 .cse548) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse549) (not (<= 0 .cse550)) (= (select (select .cse551 .cse549) .cse552) 0) (= (select (select .cse553 .cse549) .cse552) .cse549) (not (= (select .cse554 .cse555) 0)) (not (<= 0 .cse555)) (not (<= 0 .cse548))))))))))))))) (or (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse580 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse577 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse581 (select (select .cse577 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse582 (+ (select (select .cse580 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse579 (select (select .cse580 .cse581) .cse582))) (let ((.cse571 (+ .cse579 4)) (.cse572 (select (select .cse577 .cse581) .cse582))) (let ((.cse570 (select .cse577 .cse572)) (.cse575 (let ((.cse578 (store .cse580 .cse572 (store (select .cse580 .cse572) .cse571 0)))) (store .cse578 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse578 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse579))))) (let ((.cse567 (select (select .cse575 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse568 (let ((.cse576 (store .cse577 .cse572 (store .cse570 .cse571 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse576 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse576 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse572))))) (let ((.cse573 (select (select .cse568 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse574 (+ .cse567 4))) (let ((.cse569 (select (select .cse575 .cse573) .cse574)) (.cse566 (select (select .cse568 .cse573) .cse574))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse566) (not (<= 0 .cse567)) (= (select (select .cse568 .cse566) (+ 4 .cse569)) .cse566) (not (= (select .cse570 .cse571) 0)) (not (<= 0 .cse571)) (not (= .cse571 .cse569)) (not (= .cse572 .cse566)))))))))))) .cse21) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse599 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse596 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse600 (select (select .cse596 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse601 (+ (select (select .cse599 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse598 (select (select .cse599 .cse600) .cse601))) (let ((.cse590 (+ .cse598 4)) (.cse595 (select (select .cse596 .cse600) .cse601))) (let ((.cse589 (select .cse596 .cse595)) (.cse591 (let ((.cse597 (store .cse599 .cse595 (store (select .cse599 .cse595) .cse590 0)))) (store .cse597 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse597 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse598))))) (let ((.cse588 (select (select .cse591 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse585 (let ((.cse594 (store .cse596 .cse595 (store .cse589 .cse590 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse594 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse594 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse595))))) (let ((.cse592 (select (select .cse585 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse593 (+ .cse588 4))) (let ((.cse584 (select (select .cse591 .cse592) .cse593))) (let ((.cse586 (select (select .cse585 .cse592) .cse593)) (.cse587 (+ 4 .cse584))) (let ((.cse583 (select (select .cse591 .cse586) .cse587))) (or (= .cse583 .cse584) (= (select (select .cse585 .cse586) .cse587) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse588)) (= .cse583 0) (= .cse584 0) (not (= (select .cse589 .cse590) 0)) (not (<= 0 .cse590)) (not (<= 0 .cse584)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse617 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse614 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse618 (select (select .cse614 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse619 (+ (select (select .cse617 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse616 (select (select .cse617 .cse618) .cse619))) (let ((.cse606 (+ .cse616 4)) (.cse607 (select (select .cse614 .cse618) .cse619))) (let ((.cse605 (select .cse614 .cse607)) (.cse609 (let ((.cse615 (store .cse617 .cse607 (store (select .cse617 .cse607) .cse606 0)))) (store .cse615 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse615 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse616))))) (let ((.cse604 (select (select .cse609 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse612 (let ((.cse613 (store .cse614 .cse607 (store .cse605 .cse606 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse613 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse613 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse607))))) (let ((.cse610 (select (select .cse612 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse611 (+ .cse604 4))) (let ((.cse608 (select (select .cse612 .cse610) .cse611)) (.cse603 (select (select .cse609 .cse610) .cse611))) (let ((.cse602 (select (select .cse609 .cse608) (+ 4 .cse603)))) (or (= .cse602 .cse603) (not (<= 0 .cse604)) (= .cse602 0) (not (= (select .cse605 .cse606) 0)) (not (<= 0 .cse606)) (not (= .cse606 .cse603)) (not (= .cse607 .cse608))))))))))))))) (or (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse634 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse631 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse635 (select (select .cse631 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse636 (+ (select (select .cse634 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse633 (select (select .cse634 .cse635) .cse636))) (let ((.cse625 (+ .cse633 4)) (.cse626 (select (select .cse631 .cse635) .cse636))) (let ((.cse624 (select .cse631 .cse626)) (.cse620 (let ((.cse632 (store .cse634 .cse626 (store (select .cse634 .cse626) .cse625 0)))) (store .cse632 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse632 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse633))))) (let ((.cse623 (select (select .cse620 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse627 (let ((.cse630 (store .cse631 .cse626 (store .cse624 .cse625 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse630 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse630 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse626))))) (let ((.cse628 (select (select .cse627 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse629 (+ .cse623 4))) (let ((.cse622 (select (select .cse620 .cse628) .cse629)) (.cse621 (select (select .cse627 .cse628) .cse629))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (= (select (select .cse620 .cse621) (+ 4 .cse622)) .cse622) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse623)) (not (= (select .cse624 .cse625) 0)) (not (<= 0 .cse625)) (not (= .cse625 .cse622)) (not (= .cse626 .cse621)))))))))))) .cse21) .cse277 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse653 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse650 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse654 (select (select .cse650 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse655 (+ (select (select .cse653 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse652 (select (select .cse653 .cse654) .cse655))) (let ((.cse642 (+ .cse652 4)) (.cse645 (select (select .cse650 .cse654) .cse655))) (let ((.cse641 (select .cse650 .cse645)) (.cse646 (let ((.cse651 (store .cse653 .cse645 (store (select .cse653 .cse645) .cse642 0)))) (store .cse651 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse651 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse652))))) (let ((.cse640 (select (select .cse646 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse643 (let ((.cse649 (store .cse650 .cse645 (store .cse641 .cse642 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse649 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse649 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse645))))) (let ((.cse647 (select (select .cse643 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse648 (+ .cse640 4))) (let ((.cse638 (select (select .cse646 .cse647) .cse648))) (let ((.cse639 (select (select .cse643 .cse647) .cse648)) (.cse644 (+ 4 .cse638))) (let ((.cse637 (select (select .cse646 .cse639) .cse644))) (or (= .cse637 8) (= .cse637 .cse638) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse639) (not (<= 0 .cse640)) (not (= (select .cse641 .cse642) 0)) (not (= .cse637 .cse642)) (not (<= 0 .cse642)) (not (<= 0 .cse638)) (not (= (select (select .cse643 .cse639) .cse644) .cse645)))))))))))))))) .cse368 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse671 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse668 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse672 (select (select .cse668 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse673 (+ (select (select .cse671 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse670 (select (select .cse671 .cse672) .cse673))) (let ((.cse661 (+ .cse670 4)) (.cse662 (select (select .cse668 .cse672) .cse673))) (let ((.cse660 (select .cse668 .cse662)) (.cse664 (let ((.cse669 (store .cse671 .cse662 (store (select .cse671 .cse662) .cse661 0)))) (store .cse669 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse669 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse670))))) (let ((.cse658 (select (select .cse664 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse663 (let ((.cse667 (store .cse668 .cse662 (store .cse660 .cse661 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse667 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse667 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse662))))) (let ((.cse665 (select (select .cse663 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse666 (+ .cse658 4))) (let ((.cse659 (select (select .cse663 .cse665) .cse666)) (.cse656 (select (select .cse664 .cse665) .cse666))) (let ((.cse657 (select (select .cse663 .cse659) (+ 4 .cse656)))) (or (= 8 .cse656) (= .cse657 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse658)) (= .cse657 .cse659) (not (= (select .cse660 .cse661) 0)) (not (<= 0 .cse661)) (not (= .cse661 .cse656)) (not (= .cse662 .cse659))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse691 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse688 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse692 (select (select .cse688 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse693 (+ (select (select .cse691 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse690 (select (select .cse691 .cse692) .cse693))) (let ((.cse679 (+ .cse690 4)) (.cse681 (select (select .cse688 .cse692) .cse693))) (let ((.cse678 (select .cse688 .cse681)) (.cse684 (let ((.cse689 (store .cse691 .cse681 (store (select .cse691 .cse681) .cse679 0)))) (store .cse689 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse689 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse690))))) (let ((.cse676 (select (select .cse684 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse682 (let ((.cse687 (store .cse688 .cse681 (store .cse678 .cse679 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse687 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse687 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse681))))) (let ((.cse685 (select (select .cse682 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse686 (+ .cse676 4))) (let ((.cse680 (select (select .cse684 .cse685) .cse686))) (let ((.cse675 (select (select .cse682 .cse685) .cse686)) (.cse683 (+ 4 .cse680))) (let ((.cse674 (select (select .cse684 .cse675) .cse683)) (.cse677 (select (select .cse682 .cse675) .cse683))) (or (= .cse674 8) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse675) (not (<= 0 .cse676)) (= .cse677 .cse675) (not (= (select .cse678 .cse679) 0)) (not (= .cse674 .cse679)) (not (<= 0 .cse679)) (not (<= 0 .cse680)) (not (= .cse677 .cse681)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse710 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse707 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse711 (select (select .cse707 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse712 (+ (select (select .cse710 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse709 (select (select .cse710 .cse711) .cse712))) (let ((.cse701 (+ .cse709 4)) (.cse706 (select (select .cse707 .cse711) .cse712))) (let ((.cse700 (select .cse707 .cse706)) (.cse702 (let ((.cse708 (store .cse710 .cse706 (store (select .cse710 .cse706) .cse701 0)))) (store .cse708 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse708 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse709))))) (let ((.cse695 (select (select .cse702 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse696 (let ((.cse705 (store .cse707 .cse706 (store .cse700 .cse701 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse705 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse705 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse706))))) (let ((.cse703 (select (select .cse696 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse704 (+ .cse695 4))) (let ((.cse699 (select (select .cse702 .cse703) .cse704))) (let ((.cse697 (select (select .cse696 .cse703) .cse704)) (.cse698 (+ 4 .cse699))) (let ((.cse694 (select (select .cse702 .cse697) .cse698))) (or (= .cse694 8) (not (<= 0 .cse695)) (= .cse694 0) (= (select (select .cse696 .cse697) .cse698) .cse697) (= .cse699 0) (not (= (select .cse700 .cse701) 0)) (not (<= 0 .cse701)) (not (<= 0 .cse699)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse729 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse726 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse730 (select (select .cse726 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse731 (+ (select (select .cse729 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse728 (select (select .cse729 .cse730) .cse731))) (let ((.cse718 (+ .cse728 4)) (.cse721 (select (select .cse726 .cse730) .cse731))) (let ((.cse717 (select .cse726 .cse721)) (.cse722 (let ((.cse727 (store .cse729 .cse721 (store (select .cse729 .cse721) .cse718 0)))) (store .cse727 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse727 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse728))))) (let ((.cse716 (select (select .cse722 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse719 (let ((.cse725 (store .cse726 .cse721 (store .cse717 .cse718 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse725 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse725 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse721))))) (let ((.cse723 (select (select .cse719 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse724 (+ .cse716 4))) (let ((.cse714 (select (select .cse722 .cse723) .cse724))) (let ((.cse715 (select (select .cse719 .cse723) .cse724)) (.cse720 (+ 4 .cse714))) (let ((.cse713 (select (select .cse722 .cse715) .cse720))) (or (= .cse713 .cse714) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse715) (not (<= 0 .cse716)) (not (= (select .cse717 .cse718) 0)) (not (= .cse713 .cse718)) (not (<= 0 .cse718)) (not (<= 0 .cse714)) (not (= (select (select .cse719 .cse715) .cse720) .cse721)))))))))))))))) (or (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse747 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse744 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse748 (select (select .cse744 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse749 (+ (select (select .cse747 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse746 (select (select .cse747 .cse748) .cse749))) (let ((.cse733 (+ .cse746 4)) (.cse743 (select (select .cse744 .cse748) .cse749))) (let ((.cse735 (select .cse744 .cse743)) (.cse739 (let ((.cse745 (store .cse747 .cse743 (store (select .cse747 .cse743) .cse733 0)))) (store .cse745 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse745 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse746))))) (let ((.cse736 (select (select .cse739 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse738 (let ((.cse742 (store .cse744 .cse743 (store .cse735 .cse733 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse742 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse742 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse743))))) (let ((.cse740 (select (select .cse738 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse741 (+ .cse736 4))) (let ((.cse734 (select (select .cse738 .cse740) .cse741)) (.cse737 (select (select .cse739 .cse740) .cse741))) (let ((.cse732 (select (select .cse738 .cse734) (+ 4 .cse737)))) (or (= .cse732 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (< .cse733 0) (= .cse732 .cse734) (not (= (select .cse735 .cse733) 0)) (< .cse736 0) (not (= .cse737 0))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse766 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse763 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse767 (select (select .cse763 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse768 (+ (select (select .cse766 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse765 (select (select .cse766 .cse767) .cse768))) (let ((.cse750 (+ .cse765 4)) (.cse757 (select (select .cse763 .cse767) .cse768))) (let ((.cse753 (select .cse763 .cse757)) (.cse754 (let ((.cse764 (store .cse766 .cse757 (store (select .cse766 .cse757) .cse750 0)))) (store .cse764 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse764 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse765))))) (let ((.cse756 (select (select .cse754 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse759 (let ((.cse762 (store .cse763 .cse757 (store .cse753 .cse750 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse762 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse762 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse757))))) (let ((.cse760 (select (select .cse759 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse761 (+ .cse756 4))) (let ((.cse758 (select (select .cse754 .cse760) .cse761))) (let ((.cse752 (select (select .cse759 .cse760) .cse761)) (.cse755 (+ 4 .cse758))) (let ((.cse751 (select (select .cse759 .cse752) .cse755))) (or (< .cse750 0) (= .cse751 .cse752) (not (= (select .cse753 .cse750) 0)) (not (= (select (select .cse754 .cse752) .cse755) .cse750)) (< .cse756 0) (not (= .cse751 .cse757)) (not (= .cse758 0)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse784 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse781 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse785 (select (select .cse781 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse786 (+ (select (select .cse784 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse783 (select (select .cse784 .cse785) .cse786))) (let ((.cse769 (+ .cse783 4)) (.cse780 (select (select .cse781 .cse785) .cse786))) (let ((.cse774 (select .cse781 .cse780)) (.cse770 (let ((.cse782 (store .cse784 .cse780 (store (select .cse784 .cse780) .cse769 0)))) (store .cse782 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse782 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse783))))) (let ((.cse775 (select (select .cse770 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse773 (let ((.cse779 (store .cse781 .cse780 (store .cse774 .cse769 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse779 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse779 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse780))))) (let ((.cse777 (select (select .cse773 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse778 (+ .cse775 4))) (let ((.cse776 (select (select .cse770 .cse777) .cse778))) (let ((.cse772 (+ 4 .cse776)) (.cse771 (select (select .cse773 .cse777) .cse778))) (or (< .cse769 0) (= (select (select .cse770 .cse771) .cse772) 0) (= (select (select .cse773 .cse771) .cse772) .cse771) (not (= (select .cse774 .cse769) 0)) (< .cse775 0) (not (= .cse776 0)))))))))))))))) .cse787) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse804 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse801 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse805 (select (select .cse801 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse806 (+ (select (select .cse804 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse803 (select (select .cse804 .cse805) .cse806))) (let ((.cse795 (+ .cse803 4)) (.cse800 (select (select .cse801 .cse805) .cse806))) (let ((.cse794 (select .cse801 .cse800)) (.cse790 (let ((.cse802 (store .cse804 .cse800 (store (select .cse804 .cse800) .cse795 0)))) (store .cse802 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse802 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse803))))) (let ((.cse789 (select (select .cse790 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse796 (let ((.cse799 (store .cse801 .cse800 (store .cse794 .cse795 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse799 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse799 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse800))))) (let ((.cse797 (select (select .cse796 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse798 (+ .cse789 4))) (let ((.cse793 (select (select .cse790 .cse797) .cse798))) (let ((.cse791 (select (select .cse796 .cse797) .cse798)) (.cse792 (+ 4 .cse793))) (let ((.cse788 (select (select .cse796 .cse791) .cse792))) (or (= .cse788 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse789)) (= (select (select .cse790 .cse791) .cse792) 0) (= .cse788 .cse791) (= .cse793 0) (not (= (select .cse794 .cse795) 0)) (not (<= 0 .cse795)) (not (<= 0 .cse793)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse822 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse819 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse823 (select (select .cse819 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse824 (+ (select (select .cse822 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse821 (select (select .cse822 .cse823) .cse824))) (let ((.cse811 (+ .cse821 4)) (.cse813 (select (select .cse819 .cse823) .cse824))) (let ((.cse810 (select .cse819 .cse813)) (.cse815 (let ((.cse820 (store .cse822 .cse813 (store (select .cse822 .cse813) .cse811 0)))) (store .cse820 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse820 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse821))))) (let ((.cse809 (select (select .cse815 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse814 (let ((.cse818 (store .cse819 .cse813 (store .cse810 .cse811 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse818 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse818 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse813))))) (let ((.cse816 (select (select .cse814 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse817 (+ .cse809 4))) (let ((.cse807 (select (select .cse814 .cse816) .cse817)) (.cse812 (select (select .cse815 .cse816) .cse817))) (let ((.cse808 (select (select .cse814 .cse807) (+ 4 .cse812)))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse807) (= .cse808 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse809)) (= .cse808 .cse807) (not (= (select .cse810 .cse811) 0)) (not (<= 0 .cse811)) (not (= .cse811 .cse812)) (not (= .cse813 .cse807))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (or .cse21 (forall ((v_ArrVal_8525 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8524 (Array Int Int))) (let ((.cse839 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse836 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse840 (select (select .cse836 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse841 (+ (select (select .cse839 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse838 (select (select .cse839 .cse840) .cse841))) (let ((.cse830 (+ .cse838 4)) (.cse831 (select (select .cse836 .cse840) .cse841))) (let ((.cse829 (select .cse836 .cse831)) (.cse834 (let ((.cse837 (store .cse839 .cse831 (store (select .cse839 .cse831) .cse830 0)))) (store .cse837 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse837 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse838))))) (let ((.cse826 (select (select .cse834 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse827 (let ((.cse835 (store .cse836 .cse831 (store .cse829 .cse830 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse835 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse835 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse831))))) (let ((.cse832 (select (select .cse827 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse833 (+ .cse826 4))) (let ((.cse825 (select (select .cse834 .cse832) .cse833)) (.cse828 (select (select .cse827 .cse832) .cse833))) (or (= 8 .cse825) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse826)) (= (select (select .cse827 .cse828) (+ 4 .cse825)) .cse828) (not (= (select .cse829 .cse830) 0)) (not (<= 0 .cse830)) (not (= .cse830 .cse825)) (not (= .cse831 .cse828))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse857 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse854 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse858 (select (select .cse854 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse859 (+ (select (select .cse857 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse856 (select (select .cse857 .cse858) .cse859))) (let ((.cse847 (+ .cse856 4)) (.cse848 (select (select .cse854 .cse858) .cse859))) (let ((.cse846 (select .cse854 .cse848)) (.cse849 (let ((.cse855 (store .cse857 .cse848 (store (select .cse857 .cse848) .cse847 0)))) (store .cse855 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse855 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse856))))) (let ((.cse845 (select (select .cse849 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse852 (let ((.cse853 (store .cse854 .cse848 (store .cse846 .cse847 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse853 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse853 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse848))))) (let ((.cse850 (select (select .cse852 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse851 (+ .cse845 4))) (let ((.cse844 (select (select .cse852 .cse850) .cse851)) (.cse843 (select (select .cse849 .cse850) .cse851))) (let ((.cse842 (select (select .cse849 .cse844) (+ 4 .cse843)))) (or (= .cse842 .cse843) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse844) (not (<= 0 .cse845)) (= .cse842 0) (not (= (select .cse846 .cse847) 0)) (not (<= 0 .cse847)) (not (= .cse847 .cse843)) (not (= .cse848 .cse844))))))))))))))) (or (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse873 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse870 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse874 (select (select .cse870 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse875 (+ (select (select .cse873 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse872 (select (select .cse873 .cse874) .cse875))) (let ((.cse865 (+ .cse872 4)) (.cse869 (select (select .cse870 .cse874) .cse875))) (let ((.cse866 (select .cse870 .cse869)) (.cse860 (let ((.cse871 (store .cse873 .cse869 (store (select .cse873 .cse869) .cse865 0)))) (store .cse871 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse871 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse872))))) (let ((.cse867 (select (select .cse860 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse861 (let ((.cse868 (store .cse870 .cse869 (store .cse866 .cse865 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse868 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse868 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse869))))) (let ((.cse862 (select (select .cse861 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse863 (+ .cse867 4))) (let ((.cse864 (select (select .cse860 .cse862) .cse863))) (or (= (select (select .cse860 (select (select .cse861 .cse862) .cse863)) (+ 4 .cse864)) .cse864) (< .cse865 0) (not (= (select .cse866 .cse865) 0)) (< .cse867 0) (not (= .cse864 0)))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse891 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse888 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse892 (select (select .cse888 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse893 (+ (select (select .cse891 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse890 (select (select .cse891 .cse892) .cse893))) (let ((.cse881 (+ .cse890 4)) (.cse887 (select (select .cse888 .cse892) .cse893))) (let ((.cse882 (select .cse888 .cse887)) (.cse876 (let ((.cse889 (store .cse891 .cse887 (store (select .cse891 .cse887) .cse881 0)))) (store .cse889 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse889 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse890))))) (let ((.cse883 (select (select .cse876 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse880 (let ((.cse886 (store .cse888 .cse887 (store .cse882 .cse881 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse886 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse886 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse887))))) (let ((.cse884 (select (select .cse880 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse885 (+ .cse883 4))) (let ((.cse879 (select (select .cse876 .cse884) .cse885))) (let ((.cse877 (select (select .cse880 .cse884) .cse885)) (.cse878 (+ 4 .cse879))) (or (= (select (select .cse876 .cse877) .cse878) .cse879) (= (select (select .cse880 .cse877) .cse878) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (< .cse881 0) (not (= (select .cse882 .cse881) 0)) (< .cse883 0) (not (= .cse879 0))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse910 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse907 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse911 (select (select .cse907 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse912 (+ (select (select .cse910 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse909 (select (select .cse910 .cse911) .cse912))) (let ((.cse896 (+ .cse909 4)) (.cse902 (select (select .cse907 .cse911) .cse912))) (let ((.cse897 (select .cse907 .cse902)) (.cse903 (let ((.cse908 (store .cse910 .cse902 (store (select .cse910 .cse902) .cse896 0)))) (store .cse908 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse908 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse909))))) (let ((.cse898 (select (select .cse903 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse899 (let ((.cse906 (store .cse907 .cse902 (store .cse897 .cse896 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse906 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse906 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse902))))) (let ((.cse904 (select (select .cse899 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse905 (+ .cse898 4))) (let ((.cse895 (select (select .cse903 .cse904) .cse905))) (let ((.cse900 (select (select .cse899 .cse904) .cse905)) (.cse901 (+ 4 .cse895))) (let ((.cse894 (select (select .cse903 .cse900) .cse901))) (or (= .cse894 .cse895) (< .cse896 0) (not (= (select .cse897 .cse896) 0)) (not (= .cse894 .cse896)) (< .cse898 0) (not (= (select (select .cse899 .cse900) .cse901) .cse902)) (not (= .cse895 0))))))))))))))))) .cse787) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse929 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse926 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse930 (select (select .cse926 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse931 (+ (select (select .cse929 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse928 (select (select .cse929 .cse930) .cse931))) (let ((.cse920 (+ .cse928 4)) (.cse925 (select (select .cse926 .cse930) .cse931))) (let ((.cse919 (select .cse926 .cse925)) (.cse921 (let ((.cse927 (store .cse929 .cse925 (store (select .cse929 .cse925) .cse920 0)))) (store .cse927 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse927 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse928))))) (let ((.cse918 (select (select .cse921 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse916 (let ((.cse924 (store .cse926 .cse925 (store .cse919 .cse920 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse924 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse924 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse925))))) (let ((.cse922 (select (select .cse916 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse923 (+ .cse918 4))) (let ((.cse914 (select (select .cse921 .cse922) .cse923))) (let ((.cse915 (select (select .cse916 .cse922) .cse923)) (.cse917 (+ 4 .cse914))) (let ((.cse913 (select (select .cse921 .cse915) .cse917))) (or (= .cse913 .cse914) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse915) (= (select (select .cse916 .cse915) .cse917) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse918)) (= .cse913 0) (not (= (select .cse919 .cse920) 0)) (not (<= 0 .cse920)) (not (<= 0 .cse914)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse948 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse945 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse949 (select (select .cse945 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse950 (+ (select (select .cse948 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse947 (select (select .cse948 .cse949) .cse950))) (let ((.cse936 (+ .cse947 4)) (.cse940 (select (select .cse945 .cse949) .cse950))) (let ((.cse935 (select .cse945 .cse940)) (.cse937 (let ((.cse946 (store .cse948 .cse940 (store (select .cse948 .cse940) .cse936 0)))) (store .cse946 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse946 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse947))))) (let ((.cse933 (select (select .cse937 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse941 (let ((.cse944 (store .cse945 .cse940 (store .cse935 .cse936 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse944 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse944 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse940))))) (let ((.cse942 (select (select .cse941 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse943 (+ .cse933 4))) (let ((.cse939 (select (select .cse937 .cse942) .cse943))) (let ((.cse932 (select (select .cse941 .cse942) .cse943)) (.cse938 (+ 4 .cse939))) (let ((.cse934 (select (select .cse941 .cse932) .cse938))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse932) (not (<= 0 .cse933)) (= .cse934 .cse932) (not (= (select .cse935 .cse936) 0)) (not (= (select (select .cse937 .cse932) .cse938) .cse936)) (not (<= 0 .cse936)) (not (<= 0 .cse939)) (not (= .cse934 .cse940)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse966 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse963 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse967 (select (select .cse963 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse968 (+ (select (select .cse966 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse965 (select (select .cse966 .cse967) .cse968))) (let ((.cse957 (+ .cse965 4)) (.cse962 (select (select .cse963 .cse967) .cse968))) (let ((.cse956 (select .cse963 .cse962)) (.cse953 (let ((.cse964 (store .cse966 .cse962 (store (select .cse966 .cse962) .cse957 0)))) (store .cse964 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse964 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse965))))) (let ((.cse952 (select (select .cse953 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse955 (let ((.cse961 (store .cse963 .cse962 (store .cse956 .cse957 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse961 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse961 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse962))))) (let ((.cse959 (select (select .cse955 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse960 (+ .cse952 4))) (let ((.cse958 (select (select .cse953 .cse959) .cse960))) (let ((.cse954 (+ 4 .cse958)) (.cse951 (select (select .cse955 .cse959) .cse960))) (or (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse951) (not (<= 0 .cse952)) (= (select (select .cse953 .cse951) .cse954) 0) (= (select (select .cse955 .cse951) .cse954) .cse951) (not (= (select .cse956 .cse957) 0)) (not (<= 0 .cse957)) (not (<= 0 .cse958))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8525 (Array Int Int)) (v_ArrVal_8524 (Array Int Int))) (let ((.cse984 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8525)) (.cse981 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8524))) (let ((.cse985 (select (select .cse981 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse986 (+ (select (select .cse984 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse983 (select (select .cse984 .cse985) .cse986))) (let ((.cse973 (+ .cse983 4)) (.cse974 (select (select .cse981 .cse985) .cse986))) (let ((.cse972 (select .cse981 .cse974)) (.cse976 (let ((.cse982 (store .cse984 .cse974 (store (select .cse984 .cse974) .cse973 0)))) (store .cse982 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse982 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse983))))) (let ((.cse971 (select (select .cse976 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse979 (let ((.cse980 (store .cse981 .cse974 (store .cse972 .cse973 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse980 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse980 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse974))))) (let ((.cse977 (select (select .cse979 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse978 (+ .cse971 4))) (let ((.cse975 (select (select .cse979 .cse977) .cse978)) (.cse969 (select (select .cse976 .cse977) .cse978))) (let ((.cse970 (select (select .cse976 .cse975) (+ 4 .cse969)))) (or (= 8 .cse969) (= .cse970 .cse969) (not (<= 0 .cse971)) (= .cse970 0) (not (= (select .cse972 .cse973) 0)) (not (<= 0 .cse973)) (not (= .cse973 .cse969)) (not (= .cse974 .cse975))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0))))))) is different from true [2022-11-16 11:47:10,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584978642] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:10,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:47:10,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 70 [2022-11-16 11:47:10,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468909089] [2022-11-16 11:47:10,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:47:10,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-16 11:47:10,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:10,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-16 11:47:10,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=7228, Unknown=1, NotChecked=170, Total=7656 [2022-11-16 11:47:10,184 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 70 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 63 states have internal predecessors, (131), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:47:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:32,554 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-11-16 11:47:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 11:47:32,555 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 63 states have internal predecessors, (131), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 75 [2022-11-16 11:47:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:32,556 INFO L225 Difference]: With dead ends: 85 [2022-11-16 11:47:32,556 INFO L226 Difference]: Without dead ends: 85 [2022-11-16 11:47:32,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 118 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2063 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=649, Invalid=13396, Unknown=1, NotChecked=234, Total=14280 [2022-11-16 11:47:32,558 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 125 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:32,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1451 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2219 Invalid, 0 Unknown, 250 Unchecked, 6.0s Time] [2022-11-16 11:47:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-16 11:47:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-16 11:47:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 80 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-16 11:47:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-16 11:47:32,562 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 75 [2022-11-16 11:47:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:32,562 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-16 11:47:32,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 63 states have internal predecessors, (131), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:47:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-16 11:47:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 11:47:32,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:32,564 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:47:32,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-16 11:47:32,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-16 11:47:32,773 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:47:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1310476580, now seen corresponding path program 1 times [2022-11-16 11:47:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:32,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473880000] [2022-11-16 11:47:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:40,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:47:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:47:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:47:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:47:45,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:45,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473880000] [2022-11-16 11:47:45,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473880000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:45,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15221126] [2022-11-16 11:47:45,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:45,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:45,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:45,185 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:47:45,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-16 11:47:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:45,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-16 11:47:45,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:45,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:47:46,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:47:46,909 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:47:46,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:47:47,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:47:48,650 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 11:47:48,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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-16 11:47:49,440 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 13 treesize of output 9 [2022-11-16 11:47:49,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-16 11:47:49,957 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:47:49,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-11-16 11:47:49,984 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 22 treesize of output 24 [2022-11-16 11:47:51,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:47:51,623 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 1 case distinctions, treesize of input 78 treesize of output 37 [2022-11-16 11:47:51,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-16 11:47:51,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 11:47:53,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:53,634 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:47:53,635 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 84 treesize of output 70 [2022-11-16 11:47:53,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:53,697 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 11:47:53,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-16 11:47:53,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:53,778 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:47:53,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 11:47:57,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:57,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:47:57,864 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-11-16 11:47:57,864 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 207 treesize of output 99 [2022-11-16 11:47:57,929 INFO L321 Elim1Store]: treesize reduction 120, result has 11.1 percent of original size [2022-11-16 11:47:57,929 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 70 [2022-11-16 11:47:58,421 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 11:47:58,421 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 168 treesize of output 109 [2022-11-16 11:47:58,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:58,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:58,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 76 [2022-11-16 11:48:02,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:48:02,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:02,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:02,485 INFO L321 Elim1Store]: treesize reduction 49, result has 18.3 percent of original size [2022-11-16 11:48:02,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 195 treesize of output 88 [2022-11-16 11:48:02,538 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-16 11:48:02,539 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 6 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 31 [2022-11-16 11:48:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:48:03,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:48:10,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:48:10,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 84 [2022-11-16 11:48:27,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15221126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:27,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:48:27,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 78 [2022-11-16 11:48:27,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887786570] [2022-11-16 11:48:27,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:48:27,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-16 11:48:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-16 11:48:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=9344, Unknown=73, NotChecked=0, Total=9702 [2022-11-16 11:48:27,193 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 79 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 70 states have internal predecessors, (137), 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-16 11:48:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:50,576 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-11-16 11:48:50,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:48:50,576 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 70 states have internal predecessors, (137), 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 75 [2022-11-16 11:48:50,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:50,577 INFO L225 Difference]: With dead ends: 89 [2022-11-16 11:48:50,578 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 11:48:50,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2879 ImplicationChecksByTransitivity, 58.5s TimeCoverageRelationStatistics Valid=581, Invalid=15589, Unknown=86, NotChecked=0, Total=16256 [2022-11-16 11:48:50,579 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 123 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:50,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1690 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2704 Invalid, 0 Unknown, 335 Unchecked, 7.2s Time] [2022-11-16 11:48:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 11:48:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-11-16 11:48:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 81 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:48:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-11-16 11:48:50,583 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 75 [2022-11-16 11:48:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:50,584 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-11-16 11:48:50,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 70 states have internal predecessors, (137), 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-16 11:48:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-11-16 11:48:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-16 11:48:50,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:50,585 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2022-11-16 11:48:50,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:50,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:50,793 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:48:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:50,794 INFO L85 PathProgramCache]: Analyzing trace with hash 844969168, now seen corresponding path program 3 times [2022-11-16 11:48:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:50,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872833947] [2022-11-16 11:48:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:50,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:59,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:48:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:48:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:49:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:49:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:49:03,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:03,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872833947] [2022-11-16 11:49:03,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872833947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:03,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995894056] [2022-11-16 11:49:03,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:49:03,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:49:03,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:49:03,479 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:49:03,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-16 11:49:06,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:49:06,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:49:06,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 207 conjunts are in the unsatisfiable core [2022-11-16 11:49:06,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:49:08,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:49:09,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:09,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 11:49:09,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:09,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 11:49:09,680 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:49:09,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:49:10,333 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 19 treesize of output 18 [2022-11-16 11:49:10,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:49:10,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 11:49:10,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:49:11,113 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:49:11,114 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 55 treesize of output 52 [2022-11-16 11:49:11,122 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 22 treesize of output 24 [2022-11-16 11:49:12,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:12,643 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 1 case distinctions, treesize of input 61 treesize of output 28 [2022-11-16 11:49:12,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:49:12,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:12,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:49:14,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:14,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:14,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:14,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:49:14,962 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 11:49:14,962 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 69 [2022-11-16 11:49:14,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:14,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:14,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:14,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:49:15,022 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-16 11:49:15,023 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 2 case distinctions, treesize of input 40 treesize of output 50 [2022-11-16 11:49:15,108 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:49:15,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:49:19,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:19,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:49:19,446 INFO L321 Elim1Store]: treesize reduction 143, result has 14.9 percent of original size [2022-11-16 11:49:19,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 80 [2022-11-16 11:49:19,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:19,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:19,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:19,511 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-16 11:49:19,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 66 [2022-11-16 11:49:20,276 INFO L321 Elim1Store]: treesize reduction 132, result has 18.0 percent of original size [2022-11-16 11:49:20,276 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 386 treesize of output 149 [2022-11-16 11:49:20,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:20,444 INFO L321 Elim1Store]: treesize reduction 180, result has 18.6 percent of original size [2022-11-16 11:49:20,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 341 treesize of output 206 [2022-11-16 11:49:26,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:49:26,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:26,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:26,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:26,134 INFO L321 Elim1Store]: treesize reduction 186, result has 7.0 percent of original size [2022-11-16 11:49:26,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 321 treesize of output 132 [2022-11-16 11:49:26,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:26,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:49:26,211 INFO L321 Elim1Store]: treesize reduction 35, result has 22.2 percent of original size [2022-11-16 11:49:26,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 41 [2022-11-16 11:49:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 23 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:49:26,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:49:35,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:49:35,641 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 1648 treesize of output 2226 [2022-11-16 11:49:54,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995894056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:49:54,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:49:54,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46] total 89 [2022-11-16 11:49:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911398417] [2022-11-16 11:49:54,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:54,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-16 11:49:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:54,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-16 11:49:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=11170, Unknown=4, NotChecked=0, Total=11556 [2022-11-16 11:49:54,305 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 89 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 80 states have internal predecessors, (143), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:50:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:15,541 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2022-11-16 11:50:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 11:50:15,541 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 80 states have internal predecessors, (143), 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 78 [2022-11-16 11:50:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:15,542 INFO L225 Difference]: With dead ends: 80 [2022-11-16 11:50:15,542 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 11:50:15,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4954 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=728, Invalid=17628, Unknown=4, NotChecked=0, Total=18360 [2022-11-16 11:50:15,544 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 80 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:15,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1551 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2142 Invalid, 0 Unknown, 257 Unchecked, 5.8s Time] [2022-11-16 11:50:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 11:50:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-16 11:50:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 75 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-11-16 11:50:15,546 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 78 [2022-11-16 11:50:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:15,547 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-11-16 11:50:15,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 80 states have internal predecessors, (143), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:50:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-11-16 11:50:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-16 11:50:15,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:15,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:50:15,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:15,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:15,749 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:50:15,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash 424239147, now seen corresponding path program 3 times [2022-11-16 11:50:15,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:15,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749375612] [2022-11-16 11:50:15,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:15,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:16,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:16,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:16,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-16 11:50:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:16,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749375612] [2022-11-16 11:50:16,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749375612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:16,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500452428] [2022-11-16 11:50:16,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:50:16,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:16,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:16,210 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:16,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-16 11:50:19,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:50:19,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:50:19,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 11:50:19,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-16 11:50:20,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-16 11:50:21,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500452428] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:21,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:21,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-11-16 11:50:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491433740] [2022-11-16 11:50:21,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:21,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:50:21,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:21,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:50:21,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:50:21,016 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:50:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:21,319 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-11-16 11:50:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:50:21,319 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 79 [2022-11-16 11:50:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:21,320 INFO L225 Difference]: With dead ends: 78 [2022-11-16 11:50:21,320 INFO L226 Difference]: Without dead ends: 78 [2022-11-16 11:50:21,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:50:21,321 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 34 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:21,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 467 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:50:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-16 11:50:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-16 11:50:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.088235294117647) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-11-16 11:50:21,325 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 79 [2022-11-16 11:50:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:21,325 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-11-16 11:50:21,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:50:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-11-16 11:50:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-16 11:50:21,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:21,327 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:50:21,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:21,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:21,539 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:50:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1579195478, now seen corresponding path program 1 times [2022-11-16 11:50:21,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:21,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754575770] [2022-11-16 11:50:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:21,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:21,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-16 11:50:21,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754575770] [2022-11-16 11:50:21,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754575770] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447488633] [2022-11-16 11:50:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:22,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:22,001 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:22,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-16 11:50:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:22,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 11:50:22,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:22,879 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 23 treesize of output 15 [2022-11-16 11:50:22,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-16 11:50:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-16 11:50:22,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:23,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:23,259 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 34 treesize of output 38 [2022-11-16 11:50:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-16 11:50:23,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447488633] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:23,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:23,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-11-16 11:50:23,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766284335] [2022-11-16 11:50:23,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:23,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:50:23,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:23,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:50:23,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:50:23,594 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:50:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:24,491 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-11-16 11:50:24,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:50:24,492 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2022-11-16 11:50:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:24,492 INFO L225 Difference]: With dead ends: 87 [2022-11-16 11:50:24,492 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 11:50:24,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:50:24,493 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 102 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:24,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 268 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:50:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 11:50:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2022-11-16 11:50:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 75 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-16 11:50:24,497 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 82 [2022-11-16 11:50:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:24,497 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-16 11:50:24,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:50:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-16 11:50:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-16 11:50:24,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:24,499 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:50:24,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:24,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-11-16 11:50:24,707 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:50:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1579195479, now seen corresponding path program 1 times [2022-11-16 11:50:24,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:24,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670698824] [2022-11-16 11:50:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:24,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:24,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:24,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-16 11:50:25,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:25,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670698824] [2022-11-16 11:50:25,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670698824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:25,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214556517] [2022-11-16 11:50:25,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:25,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:25,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:25,007 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:25,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-16 11:50:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:25,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 11:50:25,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:25,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 11:50:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-16 11:50:25,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:25,887 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-16 11:50:25,887 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 16 treesize of output 15 [2022-11-16 11:50:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-16 11:50:25,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214556517] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:50:25,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:50:25,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-11-16 11:50:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735041032] [2022-11-16 11:50:25,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:25,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:50:25,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:25,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:50:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:50:25,917 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:50:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:26,403 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-11-16 11:50:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:50:26,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2022-11-16 11:50:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:26,404 INFO L225 Difference]: With dead ends: 86 [2022-11-16 11:50:26,405 INFO L226 Difference]: Without dead ends: 86 [2022-11-16 11:50:26,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:50:26,405 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:26,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 225 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:50:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-16 11:50:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-11-16 11:50:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-11-16 11:50:26,409 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 82 [2022-11-16 11:50:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:26,410 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-11-16 11:50:26,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:50:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-11-16 11:50:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-16 11:50:26,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:26,411 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:50:26,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-11-16 11:50:26,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:26,619 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:50:26,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1710420999, now seen corresponding path program 1 times [2022-11-16 11:50:26,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:26,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839906396] [2022-11-16 11:50:26,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-16 11:50:26,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:26,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839906396] [2022-11-16 11:50:26,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839906396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:27,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110448156] [2022-11-16 11:50:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:27,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:27,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:27,003 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:27,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-16 11:50:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:27,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:50:27,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:27,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-16 11:50:28,004 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 21 treesize of output 13 [2022-11-16 11:50:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-16 11:50:28,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-16 11:50:28,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110448156] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:28,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:28,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 10 [2022-11-16 11:50:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800024411] [2022-11-16 11:50:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:28,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:50:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:50:28,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:50:28,382 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:50:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:28,642 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-11-16 11:50:28,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:50:28,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2022-11-16 11:50:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:28,644 INFO L225 Difference]: With dead ends: 79 [2022-11-16 11:50:28,644 INFO L226 Difference]: Without dead ends: 79 [2022-11-16 11:50:28,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:50:28,645 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:28,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 184 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:50:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-16 11:50:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-16 11:50:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-11-16 11:50:28,648 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 83 [2022-11-16 11:50:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:28,649 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-11-16 11:50:28,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:50:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-11-16 11:50:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-16 11:50:28,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:28,650 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:50:28,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:28,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:28,860 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:50:28,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:28,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1483396663, now seen corresponding path program 1 times [2022-11-16 11:50:28,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:28,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41238517] [2022-11-16 11:50:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:28,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:30,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:30,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 11:50:30,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:30,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41238517] [2022-11-16 11:50:30,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41238517] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:30,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406119611] [2022-11-16 11:50:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:30,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:30,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:30,582 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:30,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-16 11:50:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:31,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-16 11:50:31,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:32,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:50:32,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-16 11:50:32,401 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_10491 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_10491))) (exists ((v_ArrVal_10490 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_10490)))) is different from true [2022-11-16 11:50:32,421 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_10492 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_10492) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10493 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_10493)))) is different from true [2022-11-16 11:50:32,440 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_10495 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_10495) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10494 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_10494)))) is different from true [2022-11-16 11:50:32,460 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_10495 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_10495))) (exists ((v_ArrVal_10494 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_10494) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:50:32,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:32,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-16 11:50:32,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:32,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:50:32,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:32,878 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 18 treesize of output 22 [2022-11-16 11:50:33,204 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 11:50:33,204 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 21 treesize of output 20 [2022-11-16 11:50:33,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:33,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:50:33,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:50:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 5 not checked. [2022-11-16 11:50:33,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:33,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10498 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_10498) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) is different from false [2022-11-16 11:50:34,625 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10507 (Array Int Int)) (v_ArrVal_10497 Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_10498 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| Int) (v_ArrVal_10508 (Array Int Int))) (let ((.cse0 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| v_ArrVal_10507) |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| |c_#StackHeapBarrier|)) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| v_ArrVal_10508))) (store .cse1 |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_10497))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_82| v_ArrVal_10498) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2022-11-16 11:50:34,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406119611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:34,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:34,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 40 [2022-11-16 11:50:34,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733311631] [2022-11-16 11:50:34,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:34,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-16 11:50:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:50:34,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-16 11:50:34,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1497, Unknown=21, NotChecked=498, Total=2162 [2022-11-16 11:50:34,630 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 41 states, 38 states have (on average 2.789473684210526) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-16 11:50:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:37,592 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-11-16 11:50:37,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:50:37,592 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.789473684210526) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 84 [2022-11-16 11:50:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:37,593 INFO L225 Difference]: With dead ends: 81 [2022-11-16 11:50:37,593 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 11:50:37,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=305, Invalid=2663, Unknown=26, NotChecked=666, Total=3660 [2022-11-16 11:50:37,594 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:37,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 444 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 236 Unchecked, 1.2s Time] [2022-11-16 11:50:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 11:50:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-16 11:50:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:50:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-11-16 11:50:37,597 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 84 [2022-11-16 11:50:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:37,598 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-11-16 11:50:37,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.789473684210526) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-16 11:50:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-11-16 11:50:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-16 11:50:37,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:37,599 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:50:37,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:37,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-11-16 11:50:37,808 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-16 11:50:37,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1259343866, now seen corresponding path program 1 times [2022-11-16 11:50:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:50:37,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648430857] [2022-11-16 11:50:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:50:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:50:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:39,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:50:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:50:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 11:50:40,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:50:40,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648430857] [2022-11-16 11:50:40,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648430857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:40,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766068542] [2022-11-16 11:50:40,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:40,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:50:40,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:50:40,123 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:50:40,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4dd30aa-7c7d-4655-af87-7a9d1ea2aa2e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-16 11:50:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:40,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 11:50:40,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:41,874 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-16 11:50:42,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:42,519 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 26 treesize of output 19 [2022-11-16 11:50:43,523 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-16 11:50:43,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2022-11-16 11:50:43,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:50:43,557 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-16 11:50:43,965 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-16 11:50:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-16 11:50:44,350 INFO L328 TraceCheckSpWp]: Computing backward predicates...