./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/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_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/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_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:11:12,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:11:12,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:11:13,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:11:13,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:11:13,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:11:13,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:11:13,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:11:13,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:11:13,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:11:13,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:11:13,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:11:13,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:11:13,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:11:13,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:11:13,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:11:13,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:11:13,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:11:13,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:11:13,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:11:13,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:11:13,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:11:13,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:11:13,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:11:13,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:11:13,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:11:13,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:11:13,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:11:13,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:11:13,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:11:13,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:11:13,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:11:13,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:11:13,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:11:13,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:11:13,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:11:13,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:11:13,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:11:13,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:11:13,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:11:13,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:11:13,095 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:11:13,141 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:11:13,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:11:13,144 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:11:13,145 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:11:13,147 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:11:13,147 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:11:13,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:11:13,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:11:13,148 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:11:13,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:11:13,150 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:11:13,150 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:11:13,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:11:13,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:11:13,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:11:13,152 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:11:13,152 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:11:13,152 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:11:13,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:11:13,153 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:11:13,153 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:11:13,153 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:11:13,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:11:13,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:11:13,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:11:13,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:11:13,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:11:13,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:11:13,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:11:13,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:11:13,158 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_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/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_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-11-16 12:11:13,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:11:13,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:11:13,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:11:13,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:11:13,523 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:11:13,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-16 12:11:13,596 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/data/2c35e74a5/32b8336287bc4dafba10492a4d3dc0e9/FLAG1f5cab38f [2022-11-16 12:11:14,240 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:11:14,246 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-16 12:11:14,265 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/data/2c35e74a5/32b8336287bc4dafba10492a4d3dc0e9/FLAG1f5cab38f [2022-11-16 12:11:14,529 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/data/2c35e74a5/32b8336287bc4dafba10492a4d3dc0e9 [2022-11-16 12:11:14,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:11:14,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:11:14,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:11:14,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:11:14,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:11:14,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:14" (1/1) ... [2022-11-16 12:11:14,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1f809f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:14, skipping insertion in model container [2022-11-16 12:11:14,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:14" (1/1) ... [2022-11-16 12:11:14,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:11:14,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:11:14,994 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_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-16 12:11:15,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:11:15,019 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:11:15,113 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_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-16 12:11:15,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:11:15,153 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:11:15,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15 WrapperNode [2022-11-16 12:11:15,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:11:15,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:11:15,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:11:15,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:11:15,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,257 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2022-11-16 12:11:15,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:11:15,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:11:15,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:11:15,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:11:15,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,318 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:11:15,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:11:15,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:11:15,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:11:15,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (1/1) ... [2022-11-16 12:11:15,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:11:15,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:15,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:11:15,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:11:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:11:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:11:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 12:11:15,431 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 12:11:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:11:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:11:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:11:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:11:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:11:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:11:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:11:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:11:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:11:15,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:11:15,681 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:11:15,683 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:11:16,159 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:11:16,167 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:11:16,167 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 12:11:16,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:16 BoogieIcfgContainer [2022-11-16 12:11:16,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:11:16,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:11:16,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:11:16,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:11:16,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:11:14" (1/3) ... [2022-11-16 12:11:16,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e0167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:16, skipping insertion in model container [2022-11-16 12:11:16,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:15" (2/3) ... [2022-11-16 12:11:16,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e0167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:16, skipping insertion in model container [2022-11-16 12:11:16,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:16" (3/3) ... [2022-11-16 12:11:16,181 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-16 12:11:16,204 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:11:16,205 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-11-16 12:11:16,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:11:16,316 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;@4bcbc7cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:11:16,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-16 12:11:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:11:16,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:16,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:11:16,330 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:16,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:16,337 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2022-11-16 12:11:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:16,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247028970] [2022-11-16 12:11:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:16,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:16,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247028970] [2022-11-16 12:11:16,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247028970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:16,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:16,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:11:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930432561] [2022-11-16 12:11:16,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:16,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:16,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:16,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:16,728 INFO L87 Difference]: Start difference. First operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:16,949 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-16 12:11:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:16,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:11:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:16,963 INFO L225 Difference]: With dead ends: 114 [2022-11-16 12:11:16,963 INFO L226 Difference]: Without dead ends: 111 [2022-11-16 12:11:16,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:16,969 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:16,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:11:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-16 12:11:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-16 12:11:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-11-16 12:11:17,049 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2022-11-16 12:11:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:17,050 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-11-16 12:11:17,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-11-16 12:11:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:11:17,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:17,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:11:17,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:11:17,053 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:17,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:17,055 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2022-11-16 12:11:17,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:17,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032275390] [2022-11-16 12:11:17,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:17,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:17,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:17,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032275390] [2022-11-16 12:11:17,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032275390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:17,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:17,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:11:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759273756] [2022-11-16 12:11:17,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:17,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:17,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:17,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:17,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:17,244 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:17,343 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-11-16 12:11:17,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:17,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:11:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:17,346 INFO L225 Difference]: With dead ends: 109 [2022-11-16 12:11:17,346 INFO L226 Difference]: Without dead ends: 109 [2022-11-16 12:11:17,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:17,348 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:17,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:11:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-16 12:11:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-16 12:11:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.88135593220339) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-11-16 12:11:17,368 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2022-11-16 12:11:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:17,372 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-11-16 12:11:17,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-11-16 12:11:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:11:17,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:17,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:17,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:11:17,376 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:17,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:17,380 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2022-11-16 12:11:17,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:17,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134693652] [2022-11-16 12:11:17,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:17,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:17,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:17,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134693652] [2022-11-16 12:11:17,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134693652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:17,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:17,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:11:17,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813550316] [2022-11-16 12:11:17,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:17,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:11:17,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:17,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:11:17,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:11:17,573 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:11:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:17,725 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-16 12:11:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:11:17,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-16 12:11:17,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:17,727 INFO L225 Difference]: With dead ends: 116 [2022-11-16 12:11:17,727 INFO L226 Difference]: Without dead ends: 116 [2022-11-16 12:11:17,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:11:17,729 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:17,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:11:17,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-16 12:11:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2022-11-16 12:11:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2022-11-16 12:11:17,740 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2022-11-16 12:11:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:17,741 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2022-11-16 12:11:17,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:11:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2022-11-16 12:11:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:11:17,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:17,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:17,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:11:17,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:17,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2022-11-16 12:11:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:17,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021999450] [2022-11-16 12:11:17,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:11:17,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:17,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021999450] [2022-11-16 12:11:17,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021999450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:17,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:17,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:11:17,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288729414] [2022-11-16 12:11:17,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:17,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:11:17,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:17,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:11:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:11:17,954 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:11:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:18,272 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-11-16 12:11:18,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:11:18,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-16 12:11:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:18,275 INFO L225 Difference]: With dead ends: 110 [2022-11-16 12:11:18,275 INFO L226 Difference]: Without dead ends: 110 [2022-11-16 12:11:18,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:11:18,277 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:18,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 380 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:11:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-16 12:11:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-11-16 12:11:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-11-16 12:11:18,286 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2022-11-16 12:11:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:18,286 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-11-16 12:11:18,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:11:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-11-16 12:11:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:11:18,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:18,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:18,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:11:18,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2022-11-16 12:11:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:18,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936435373] [2022-11-16 12:11:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:18,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:11:18,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:18,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936435373] [2022-11-16 12:11:18,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936435373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:18,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:18,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:11:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216881280] [2022-11-16 12:11:18,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:18,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:11:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:18,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:11:18,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:11:18,754 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:11:19,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:19,091 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-11-16 12:11:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:11:19,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-16 12:11:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:19,093 INFO L225 Difference]: With dead ends: 109 [2022-11-16 12:11:19,093 INFO L226 Difference]: Without dead ends: 109 [2022-11-16 12:11:19,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:11:19,095 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:19,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:11:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-16 12:11:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2022-11-16 12:11:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-11-16 12:11:19,102 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2022-11-16 12:11:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:19,103 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-11-16 12:11:19,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:11:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-11-16 12:11:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:11:19,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:19,104 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:19,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:11:19,105 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2022-11-16 12:11:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:19,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398746213] [2022-11-16 12:11:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:19,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:11:19,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:19,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398746213] [2022-11-16 12:11:19,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398746213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:19,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6078641] [2022-11-16 12:11:19,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:19,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:19,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:19,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:19,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:11:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:19,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:11:19,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:19,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:11:19,880 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2022-11-16 12:11:19,921 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2022-11-16 12:11:19,952 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:11:19,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 12:11:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-16 12:11:20,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:11:20,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6078641] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:11:20,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:11:20,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-11-16 12:11:20,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235758045] [2022-11-16 12:11:20,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:20,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:11:20,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:20,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:11:20,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2022-11-16 12:11:20,467 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:11:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:20,868 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2022-11-16 12:11:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:11:20,869 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-16 12:11:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:20,869 INFO L225 Difference]: With dead ends: 114 [2022-11-16 12:11:20,870 INFO L226 Difference]: Without dead ends: 114 [2022-11-16 12:11:20,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=304, Unknown=2, NotChecked=74, Total=462 [2022-11-16 12:11:20,871 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 31 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:20,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 600 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 351 Unchecked, 0.3s Time] [2022-11-16 12:11:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-16 12:11:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-16 12:11:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2022-11-16 12:11:20,878 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 25 [2022-11-16 12:11:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:20,878 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2022-11-16 12:11:20,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:11:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2022-11-16 12:11:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:11:20,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:20,879 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:20,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:21,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:21,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2022-11-16 12:11:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:21,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194978326] [2022-11-16 12:11:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:21,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:21,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:11:21,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:21,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194978326] [2022-11-16 12:11:21,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194978326] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:21,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553131569] [2022-11-16 12:11:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:21,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:21,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:21,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:21,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:11:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:21,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 12:11:21,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:21,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:11:22,209 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:11:22,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:11:22,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-16 12:11:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:22,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:22,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553131569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:22,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:11:22,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-11-16 12:11:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320398442] [2022-11-16 12:11:22,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:22,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 12:11:22,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:22,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 12:11:22,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:11:22,568 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 12:11:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:23,454 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-11-16 12:11:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:11:23,455 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-11-16 12:11:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:23,456 INFO L225 Difference]: With dead ends: 115 [2022-11-16 12:11:23,456 INFO L226 Difference]: Without dead ends: 115 [2022-11-16 12:11:23,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-11-16 12:11:23,458 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 209 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:23,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 590 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:11:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-16 12:11:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-11-16 12:11:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2022-11-16 12:11:23,464 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 25 [2022-11-16 12:11:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:23,464 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2022-11-16 12:11:23,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 12:11:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-11-16 12:11:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:11:23,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:23,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:23,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:23,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:23,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:23,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2022-11-16 12:11:23,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:23,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940499504] [2022-11-16 12:11:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:24,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:24,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:11:24,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:24,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940499504] [2022-11-16 12:11:24,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940499504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:24,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011067417] [2022-11-16 12:11:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:24,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:24,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:24,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:11:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:24,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 12:11:24,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:24,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:11:24,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:11:24,562 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:11:24,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:24,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:11:24,645 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_522))) is different from true [2022-11-16 12:11:24,664 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_522))) is different from true [2022-11-16 12:11:24,687 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:11:24,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 12:11:24,774 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-16 12:11:24,822 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:11:24,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:11:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-16 12:11:24,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:25,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011067417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:25,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:11:25,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2022-11-16 12:11:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885785581] [2022-11-16 12:11:25,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:25,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:11:25,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:25,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:11:25,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2022-11-16 12:11:25,403 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 12:11:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:25,886 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-11-16 12:11:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:11:25,887 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-16 12:11:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:25,888 INFO L225 Difference]: With dead ends: 127 [2022-11-16 12:11:25,888 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 12:11:25,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=368, Unknown=4, NotChecked=172, Total=650 [2022-11-16 12:11:25,890 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 182 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:25,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 305 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 299 Invalid, 0 Unknown, 486 Unchecked, 0.3s Time] [2022-11-16 12:11:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 12:11:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2022-11-16 12:11:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.621212121212121) internal successors, (107), 100 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2022-11-16 12:11:25,896 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 37 [2022-11-16 12:11:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:25,897 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2022-11-16 12:11:25,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 12:11:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-11-16 12:11:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:11:25,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:25,898 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:25,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:26,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:26,105 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:26,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:26,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2022-11-16 12:11:26,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:26,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628287008] [2022-11-16 12:11:26,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:26,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:26,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:11:26,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:26,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628287008] [2022-11-16 12:11:26,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628287008] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:26,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633400007] [2022-11-16 12:11:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:26,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:26,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:26,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:26,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:11:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:27,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 12:11:27,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:27,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:11:27,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:11:27,136 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_686 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_686) |c_#length|)))) is different from true [2022-11-16 12:11:27,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:27,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 12:11:27,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:11:27,220 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_687 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_687))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:11:27,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:27,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:11:27,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:11:27,356 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:11:27,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:27,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:11:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-16 12:11:27,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:27,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633400007] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:27,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:11:27,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-16 12:11:27,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210767985] [2022-11-16 12:11:27,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:27,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:11:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:27,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:11:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-11-16 12:11:27,602 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 12:11:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:28,065 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-11-16 12:11:28,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:11:28,065 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-16 12:11:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:28,068 INFO L225 Difference]: With dead ends: 116 [2022-11-16 12:11:28,068 INFO L226 Difference]: Without dead ends: 116 [2022-11-16 12:11:28,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-11-16 12:11:28,073 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 288 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:28,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 162 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 231 Invalid, 0 Unknown, 276 Unchecked, 0.3s Time] [2022-11-16 12:11:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-16 12:11:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-11-16 12:11:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.5) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-11-16 12:11:28,097 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 37 [2022-11-16 12:11:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:28,098 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-11-16 12:11:28,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 12:11:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-11-16 12:11:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 12:11:28,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:28,101 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:28,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:28,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 12:11:28,308 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:28,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:28,309 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2022-11-16 12:11:28,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:28,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008760305] [2022-11-16 12:11:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:28,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:28,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:28,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:11:28,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:28,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008760305] [2022-11-16 12:11:28,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008760305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:28,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:28,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:11:28,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050512214] [2022-11-16 12:11:28,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:28,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:11:28,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:28,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:11:28,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:11:28,489 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:11:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:28,741 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2022-11-16 12:11:28,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:11:28,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-16 12:11:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:28,744 INFO L225 Difference]: With dead ends: 114 [2022-11-16 12:11:28,744 INFO L226 Difference]: Without dead ends: 114 [2022-11-16 12:11:28,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:11:28,745 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 69 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:28,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 266 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:11:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-16 12:11:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-11-16 12:11:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-11-16 12:11:28,753 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 39 [2022-11-16 12:11:28,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:28,753 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-11-16 12:11:28,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:11:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-11-16 12:11:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 12:11:28,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:28,755 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:28,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:11:28,755 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:28,756 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2022-11-16 12:11:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:28,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074717179] [2022-11-16 12:11:28,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:28,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:28,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:28,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:28,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:11:29,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:29,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074717179] [2022-11-16 12:11:29,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074717179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:29,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:29,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:11:29,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884059510] [2022-11-16 12:11:29,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:29,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:11:29,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:29,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:11:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:11:29,087 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:11:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:29,299 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-11-16 12:11:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:11:29,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-16 12:11:29,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:29,301 INFO L225 Difference]: With dead ends: 94 [2022-11-16 12:11:29,301 INFO L226 Difference]: Without dead ends: 94 [2022-11-16 12:11:29,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:11:29,302 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 75 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:29,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 288 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:11:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-16 12:11:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-16 12:11:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-11-16 12:11:29,306 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 39 [2022-11-16 12:11:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:29,306 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-11-16 12:11:29,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:11:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-11-16 12:11:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:11:29,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:29,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:29,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:11:29,310 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:29,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:29,311 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2022-11-16 12:11:29,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:29,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381546163] [2022-11-16 12:11:29,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:29,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:29,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:29,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:29,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:11:30,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:30,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381546163] [2022-11-16 12:11:30,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381546163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:30,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050164904] [2022-11-16 12:11:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:30,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:30,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:30,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:30,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:11:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:30,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 12:11:30,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:30,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-16 12:11:30,728 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1044 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1044))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-16 12:11:30,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:30,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:11:30,778 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 12:11:30,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:11:30,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 12:11:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 12:11:30,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:11:30,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050164904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:30,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:11:30,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-16 12:11:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139107890] [2022-11-16 12:11:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:30,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:11:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:11:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-11-16 12:11:30,944 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:11:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:31,461 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2022-11-16 12:11:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:11:31,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-16 12:11:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:31,463 INFO L225 Difference]: With dead ends: 137 [2022-11-16 12:11:31,463 INFO L226 Difference]: Without dead ends: 137 [2022-11-16 12:11:31,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=703, Unknown=2, NotChecked=54, Total=870 [2022-11-16 12:11:31,464 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 67 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:31,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 730 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 505 Invalid, 0 Unknown, 286 Unchecked, 0.4s Time] [2022-11-16 12:11:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-16 12:11:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2022-11-16 12:11:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 87 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-11-16 12:11:31,469 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 41 [2022-11-16 12:11:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:31,469 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-11-16 12:11:31,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:11:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-11-16 12:11:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:11:31,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:31,474 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:31,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:31,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:11:31,681 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash -372386586, now seen corresponding path program 1 times [2022-11-16 12:11:31,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:31,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016707647] [2022-11-16 12:11:31,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:31,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:32,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:11:33,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:33,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016707647] [2022-11-16 12:11:33,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016707647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:33,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863830653] [2022-11-16 12:11:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:33,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:33,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:33,033 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:33,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:11:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:33,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-16 12:11:33,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:33,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 12:11:33,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:11:34,056 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1203 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1203))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1199 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1199) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1202 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1202))))) is different from true [2022-11-16 12:11:34,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:34,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:11:34,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:34,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:11:34,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:34,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:11:34,161 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:11:34,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 12:11:34,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 12:11:34,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 15 treesize of output 7 [2022-11-16 12:11:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 12:11:34,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:34,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863830653] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:34,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:11:34,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-11-16 12:11:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026950586] [2022-11-16 12:11:34,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:34,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 12:11:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:34,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 12:11:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2022-11-16 12:11:34,796 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:11:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:36,621 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-16 12:11:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 12:11:36,624 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-16 12:11:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:36,625 INFO L225 Difference]: With dead ends: 146 [2022-11-16 12:11:36,625 INFO L226 Difference]: Without dead ends: 146 [2022-11-16 12:11:36,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=232, Invalid=2217, Unknown=5, NotChecked=96, Total=2550 [2022-11-16 12:11:36,627 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 127 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:36,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1332 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 670 Invalid, 0 Unknown, 271 Unchecked, 0.7s Time] [2022-11-16 12:11:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-16 12:11:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. [2022-11-16 12:11:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-11-16 12:11:36,633 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 41 [2022-11-16 12:11:36,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:36,633 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-11-16 12:11:36,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:11:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-11-16 12:11:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:11:36,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:36,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:36,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:36,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 12:11:36,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1333284459, now seen corresponding path program 1 times [2022-11-16 12:11:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:36,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835426047] [2022-11-16 12:11:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:37,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-16 12:11:37,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:37,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835426047] [2022-11-16 12:11:37,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835426047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:37,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:37,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:11:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361985758] [2022-11-16 12:11:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:37,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:11:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:37,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:11:37,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:11:37,069 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:11:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:37,213 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-16 12:11:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:11:37,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-11-16 12:11:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:37,216 INFO L225 Difference]: With dead ends: 114 [2022-11-16 12:11:37,216 INFO L226 Difference]: Without dead ends: 114 [2022-11-16 12:11:37,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:11:37,217 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 85 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:37,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 177 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:11:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-16 12:11:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-11-16 12:11:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.380281690140845) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-11-16 12:11:37,222 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 42 [2022-11-16 12:11:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:37,223 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-11-16 12:11:37,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:11:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-11-16 12:11:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 12:11:37,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:37,225 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:37,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:11:37,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:37,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112687, now seen corresponding path program 1 times [2022-11-16 12:11:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:37,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161972407] [2022-11-16 12:11:37,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:37,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:11:37,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:37,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161972407] [2022-11-16 12:11:37,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161972407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:37,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:37,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:11:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931944092] [2022-11-16 12:11:37,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:37,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:11:37,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:37,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:11:37,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:11:37,588 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:11:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:37,983 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2022-11-16 12:11:37,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:11:37,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2022-11-16 12:11:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:37,985 INFO L225 Difference]: With dead ends: 159 [2022-11-16 12:11:37,985 INFO L226 Difference]: Without dead ends: 159 [2022-11-16 12:11:37,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:11:37,986 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 186 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:37,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 418 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:11:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-16 12:11:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 99. [2022-11-16 12:11:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.36) internal successors, (102), 93 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-16 12:11:37,990 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 44 [2022-11-16 12:11:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:37,991 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-16 12:11:37,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:11:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-16 12:11:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 12:11:37,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:37,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:37,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:11:37,993 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:37,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:37,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112688, now seen corresponding path program 1 times [2022-11-16 12:11:37,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:37,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292736260] [2022-11-16 12:11:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:37,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:38,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:38,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:38,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:11:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:38,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292736260] [2022-11-16 12:11:38,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292736260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:38,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:38,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:11:38,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917784217] [2022-11-16 12:11:38,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:38,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:11:38,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:38,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:11:38,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:11:38,583 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:11:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:38,976 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-11-16 12:11:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:11:38,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2022-11-16 12:11:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:38,978 INFO L225 Difference]: With dead ends: 141 [2022-11-16 12:11:38,978 INFO L226 Difference]: Without dead ends: 141 [2022-11-16 12:11:38,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:11:38,979 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 279 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:38,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 400 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:11:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-16 12:11:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2022-11-16 12:11:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 95 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-11-16 12:11:39,001 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 44 [2022-11-16 12:11:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:39,001 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-11-16 12:11:39,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:11:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-11-16 12:11:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:11:39,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:39,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:39,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:11:39,006 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash 614432594, now seen corresponding path program 1 times [2022-11-16 12:11:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:39,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476956536] [2022-11-16 12:11:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:39,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:39,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:39,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:11:39,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:39,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476956536] [2022-11-16 12:11:39,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476956536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:39,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969665581] [2022-11-16 12:11:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:39,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:39,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:11:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:39,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 12:11:39,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:40,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 12:11:40,489 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1724 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1724) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:11:40,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:40,528 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 12:11:40,584 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 12:11:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 12:11:40,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:40,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969665581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:40,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:11:40,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-16 12:11:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447829506] [2022-11-16 12:11:40,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:40,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 12:11:40,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:40,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 12:11:40,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=611, Unknown=8, NotChecked=50, Total=756 [2022-11-16 12:11:40,802 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:11:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:41,723 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-11-16 12:11:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:11:41,724 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-16 12:11:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:41,725 INFO L225 Difference]: With dead ends: 97 [2022-11-16 12:11:41,725 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 12:11:41,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=1010, Unknown=8, NotChecked=66, Total=1260 [2022-11-16 12:11:41,726 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 251 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:41,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 634 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 535 Invalid, 0 Unknown, 87 Unchecked, 0.5s Time] [2022-11-16 12:11:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 12:11:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-11-16 12:11:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:11:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-11-16 12:11:41,731 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 46 [2022-11-16 12:11:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:41,731 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-11-16 12:11:41,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:11:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-11-16 12:11:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:11:41,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:41,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:41,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:41,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 12:11:41,933 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450120, now seen corresponding path program 1 times [2022-11-16 12:11:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:41,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777986811] [2022-11-16 12:11:41,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:41,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:42,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:43,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:11:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:43,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777986811] [2022-11-16 12:11:43,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777986811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:43,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237294266] [2022-11-16 12:11:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:43,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:43,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:43,748 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:43,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:11:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:43,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-16 12:11:44,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:44,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:11:44,417 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:11:44,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:11:44,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:11:44,809 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:11:44,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 12:11:45,079 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:11:45,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-11-16 12:11:45,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:11:45,315 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1892) |c_#memory_$Pointer$.base|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1891)))) is different from true [2022-11-16 12:11:45,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:45,385 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:11:45,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-11-16 12:11:45,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:45,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:11:45,435 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-16 12:11:45,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-16 12:11:45,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:11:45,807 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:11:45,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-11-16 12:11:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:11:45,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:46,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237294266] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:46,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:11:46,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-11-16 12:11:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807118504] [2022-11-16 12:11:46,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:46,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 12:11:46,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:46,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 12:11:46,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1918, Unknown=1, NotChecked=88, Total=2162 [2022-11-16 12:11:46,184 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:11:47,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:47,489 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-11-16 12:11:47,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:11:47,490 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-16 12:11:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:47,491 INFO L225 Difference]: With dead ends: 115 [2022-11-16 12:11:47,491 INFO L226 Difference]: Without dead ends: 115 [2022-11-16 12:11:47,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=260, Invalid=2823, Unknown=1, NotChecked=108, Total=3192 [2022-11-16 12:11:47,493 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 46 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:47,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 931 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 745 Invalid, 0 Unknown, 204 Unchecked, 0.7s Time] [2022-11-16 12:11:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-16 12:11:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-11-16 12:11:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 105 states have internal predecessors, (115), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:11:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-11-16 12:11:47,498 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 46 [2022-11-16 12:11:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:47,498 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-11-16 12:11:47,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:11:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-11-16 12:11:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:11:47,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:47,499 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:47,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-16 12:11:47,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:11:47,706 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:47,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:47,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450121, now seen corresponding path program 1 times [2022-11-16 12:11:47,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:47,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54949543] [2022-11-16 12:11:47,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:47,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:49,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:49,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:11:50,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:50,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54949543] [2022-11-16 12:11:50,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54949543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:50,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138765095] [2022-11-16 12:11:50,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:50,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:50,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:50,554 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:50,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:11:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:50,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-16 12:11:50,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:50,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:11:51,392 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:11:51,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:11:51,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:11:51,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 11 treesize of output 7 [2022-11-16 12:11:51,918 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:11:51,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-16 12:11:51,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 12:11:52,302 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:11:52,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2022-11-16 12:11:52,318 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 12:11:52,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:11:52,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:11:52,597 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2070 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2069 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2069)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2070) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:11:52,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:52,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:52,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:52,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 12:11:52,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:11:52,700 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:11:52,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-11-16 12:11:52,729 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 12:11:52,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 12:11:52,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-16 12:11:53,259 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-16 12:11:53,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2022-11-16 12:11:53,271 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:11:53,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-16 12:11:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:11:53,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:54,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138765095] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:54,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:11:54,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 52 [2022-11-16 12:11:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429245009] [2022-11-16 12:11:54,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:54,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-16 12:11:54,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:54,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-16 12:11:54,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3229, Unknown=1, NotChecked=114, Total=3540 [2022-11-16 12:11:54,347 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 53 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 46 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:11:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:58,149 INFO L93 Difference]: Finished difference Result 220 states and 240 transitions. [2022-11-16 12:11:58,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 12:11:58,150 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 46 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-16 12:11:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:58,151 INFO L225 Difference]: With dead ends: 220 [2022-11-16 12:11:58,152 INFO L226 Difference]: Without dead ends: 220 [2022-11-16 12:11:58,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=416, Invalid=5593, Unknown=1, NotChecked=152, Total=6162 [2022-11-16 12:11:58,154 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 201 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:58,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1952 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1657 Invalid, 0 Unknown, 321 Unchecked, 1.4s Time] [2022-11-16 12:11:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-16 12:11:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 112. [2022-11-16 12:11:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.313953488372093) internal successors, (113), 104 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:11:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2022-11-16 12:11:58,176 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 46 [2022-11-16 12:11:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:58,177 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2022-11-16 12:11:58,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 46 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:11:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-11-16 12:11:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:11:58,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:58,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:58,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-16 12:11:58,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:58,379 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:11:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash 865523061, now seen corresponding path program 1 times [2022-11-16 12:11:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:58,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031430060] [2022-11-16 12:11:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:58,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:59,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:59,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:11:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:11:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:11:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:59,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031430060] [2022-11-16 12:11:59,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031430060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:59,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484529448] [2022-11-16 12:11:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:59,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:59,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:59,757 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:59,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:12:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:00,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 12:12:00,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:12:00,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:12:00,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:12:00,125 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-16 12:12:00,153 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:12:00,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:12:00,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:12:00,316 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:12:00,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:12:00,694 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 12:12:01,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:01,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-16 12:12:01,105 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-16 12:12:01,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-16 12:12:01,585 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:12:01,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 12:12:01,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:01,692 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 12:12:01,773 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 12:12:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-16 12:12:01,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:12:01,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-16 12:12:03,817 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2265) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-16 12:12:05,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2265) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-16 12:12:12,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2265) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-16 12:12:12,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2273 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| Int) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_2273) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_2272))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2265)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_2266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1))) is different from false [2022-11-16 12:12:12,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484529448] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:12,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:12:12,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2022-11-16 12:12:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451440559] [2022-11-16 12:12:12,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:12:12,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 12:12:12,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:12,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 12:12:12,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1831, Unknown=34, NotChecked=546, Total=2550 [2022-11-16 12:12:12,124 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:12:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:15,254 INFO L93 Difference]: Finished difference Result 320 states and 348 transitions. [2022-11-16 12:12:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 12:12:15,255 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-16 12:12:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:15,257 INFO L225 Difference]: With dead ends: 320 [2022-11-16 12:12:15,257 INFO L226 Difference]: Without dead ends: 320 [2022-11-16 12:12:15,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=406, Invalid=4836, Unknown=38, NotChecked=882, Total=6162 [2022-11-16 12:12:15,260 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 574 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:15,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1394 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1447 Invalid, 0 Unknown, 309 Unchecked, 1.2s Time] [2022-11-16 12:12:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-16 12:12:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 147. [2022-11-16 12:12:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 119 states have (on average 1.3025210084033614) internal successors, (155), 137 states have internal predecessors, (155), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-16 12:12:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2022-11-16 12:12:15,270 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 51 [2022-11-16 12:12:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:15,270 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2022-11-16 12:12:15,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:12:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2022-11-16 12:12:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:12:15,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:15,272 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:15,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:12:15,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:12:15,479 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:12:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash 865523062, now seen corresponding path program 1 times [2022-11-16 12:12:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:15,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135382018] [2022-11-16 12:12:15,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:12:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:12:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:12:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:17,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135382018] [2022-11-16 12:12:17,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135382018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:17,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781942117] [2022-11-16 12:12:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:17,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:12:17,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:12:17,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:12:17,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:12:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:17,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-16 12:12:17,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:12:17,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:12:17,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:12:17,944 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-16 12:12:17,978 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:12:17,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:12:18,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:12:18,238 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:12:18,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:12:18,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-16 12:12:18,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 12:12:19,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:19,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2022-11-16 12:12:19,196 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:12:19,196 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 12:12:19,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-16 12:12:19,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:19,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2022-11-16 12:12:19,729 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:12:19,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2022-11-16 12:12:19,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 12:12:19,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:19,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-16 12:12:19,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:19,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-16 12:12:19,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 31 treesize of output 19 [2022-11-16 12:12:20,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-16 12:12:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-16 12:12:20,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:12:20,327 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2461 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2462) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-16 12:12:21,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781942117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:21,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:12:21,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2022-11-16 12:12:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135396957] [2022-11-16 12:12:21,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:12:21,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 12:12:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:21,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 12:12:21,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2541, Unknown=36, NotChecked=206, Total=2970 [2022-11-16 12:12:21,948 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:12:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:25,009 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2022-11-16 12:12:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:12:25,010 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-16 12:12:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:25,011 INFO L225 Difference]: With dead ends: 260 [2022-11-16 12:12:25,012 INFO L226 Difference]: Without dead ends: 260 [2022-11-16 12:12:25,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=413, Invalid=4815, Unknown=36, NotChecked=286, Total=5550 [2022-11-16 12:12:25,014 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 581 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:25,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1172 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1218 Invalid, 0 Unknown, 114 Unchecked, 1.1s Time] [2022-11-16 12:12:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-16 12:12:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 164. [2022-11-16 12:12:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 154 states have internal predecessors, (174), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-16 12:12:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 188 transitions. [2022-11-16 12:12:25,022 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 188 transitions. Word has length 51 [2022-11-16 12:12:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:25,022 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 188 transitions. [2022-11-16 12:12:25,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:12:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 188 transitions. [2022-11-16 12:12:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:12:25,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:25,024 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:25,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:12:25,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:12:25,231 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:12:25,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash -396596539, now seen corresponding path program 2 times [2022-11-16 12:12:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:25,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678572672] [2022-11-16 12:12:25,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:25,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:12:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:12:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:12:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:27,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678572672] [2022-11-16 12:12:27,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678572672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:27,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301787793] [2022-11-16 12:12:27,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:12:27,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:12:27,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:12:27,460 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:12:27,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:12:27,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:12:27,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:12:27,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-16 12:12:27,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:12:27,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:12:28,195 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:12:28,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:12:28,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:12:28,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:12:28,624 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:12:28,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-11-16 12:12:28,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 12:12:29,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:29,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:29,365 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:12:29,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2022-11-16 12:12:29,409 INFO L321 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-11-16 12:12:29,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 70 [2022-11-16 12:12:29,441 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 12:12:29,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 12:12:31,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:31,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:12:31,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:31,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:31,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:12:31,124 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:12:31,124 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 30 [2022-11-16 12:12:31,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:12:31,709 INFO L321 Elim1Store]: treesize reduction 142, result has 13.4 percent of original size [2022-11-16 12:12:31,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 60 [2022-11-16 12:12:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:31,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:12:32,282 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-11-16 12:12:32,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-16 12:12:33,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301787793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:33,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:12:33,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2022-11-16 12:12:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894762446] [2022-11-16 12:12:33,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:12:33,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-16 12:12:33,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:33,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-16 12:12:33,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4459, Unknown=4, NotChecked=0, Total=4692 [2022-11-16 12:12:33,177 INFO L87 Difference]: Start difference. First operand 164 states and 188 transitions. Second operand has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:12:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:37,149 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2022-11-16 12:12:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 12:12:37,150 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-11-16 12:12:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:37,151 INFO L225 Difference]: With dead ends: 158 [2022-11-16 12:12:37,151 INFO L226 Difference]: Without dead ends: 158 [2022-11-16 12:12:37,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=479, Invalid=8259, Unknown=4, NotChecked=0, Total=8742 [2022-11-16 12:12:37,154 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 41 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:37,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1983 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 993 Invalid, 0 Unknown, 275 Unchecked, 0.9s Time] [2022-11-16 12:12:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-16 12:12:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-11-16 12:12:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 129 states have (on average 1.248062015503876) internal successors, (161), 147 states have internal predecessors, (161), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-16 12:12:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2022-11-16 12:12:37,160 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 51 [2022-11-16 12:12:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:37,161 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2022-11-16 12:12:37,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:12:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2022-11-16 12:12:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 12:12:37,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:37,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:37,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:12:37,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 12:12:37,369 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:12:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:37,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1455991656, now seen corresponding path program 1 times [2022-11-16 12:12:37,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:37,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829150307] [2022-11-16 12:12:37,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:37,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:38,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:12:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:38,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:12:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:12:38,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:38,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829150307] [2022-11-16 12:12:38,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829150307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:38,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099402055] [2022-11-16 12:12:38,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:38,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:12:38,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:12:38,922 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:12:38,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:12:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:39,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-16 12:12:39,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:12:39,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:12:39,656 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:12:39,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:12:39,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:12:40,046 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:12:40,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-16 12:12:40,319 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:12:40,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2022-11-16 12:12:40,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:12:40,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:12:40,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:40,654 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 12:12:40,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2022-11-16 12:12:40,675 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:12:40,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 12:12:40,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:40,684 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 12:12:41,221 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-16 12:12:41,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 29 [2022-11-16 12:12:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:41,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:12:41,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| Int)) (or (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_2852))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_2851) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| |c_#StackHeapBarrier|)))) is different from false [2022-11-16 12:12:41,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099402055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:41,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:12:41,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2022-11-16 12:12:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430525003] [2022-11-16 12:12:41,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:12:41,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-16 12:12:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:41,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-16 12:12:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2482, Unknown=1, NotChecked=100, Total=2756 [2022-11-16 12:12:41,714 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:12:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:44,623 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2022-11-16 12:12:44,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:12:44,624 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-11-16 12:12:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:44,625 INFO L225 Difference]: With dead ends: 157 [2022-11-16 12:12:44,626 INFO L226 Difference]: Without dead ends: 157 [2022-11-16 12:12:44,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=336, Invalid=4089, Unknown=1, NotChecked=130, Total=4556 [2022-11-16 12:12:44,627 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 136 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:44,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1587 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1722 Invalid, 0 Unknown, 58 Unchecked, 1.5s Time] [2022-11-16 12:12:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-16 12:12:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-16 12:12:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 129 states have (on average 1.2403100775193798) internal successors, (160), 147 states have internal predecessors, (160), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-16 12:12:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2022-11-16 12:12:44,633 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 53 [2022-11-16 12:12:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:44,634 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2022-11-16 12:12:44,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:12:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2022-11-16 12:12:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-16 12:12:44,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:44,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:44,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:12:44,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 12:12:44,842 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:12:44,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:44,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1874385561, now seen corresponding path program 1 times [2022-11-16 12:12:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:44,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911679861] [2022-11-16 12:12:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:44,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:12:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:12:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:12:47,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:47,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911679861] [2022-11-16 12:12:47,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911679861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:47,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909586856] [2022-11-16 12:12:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:47,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:12:47,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:12:47,416 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:12:47,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 12:12:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:47,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-16 12:12:47,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:12:47,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:12:47,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:12:47,903 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3032 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3032) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:12:47,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:47,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:12:47,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:12:48,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:48,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:12:48,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-16 12:12:48,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:12:48,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:48,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:12:48,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:12:49,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:49,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-16 12:12:49,346 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:12:49,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 12:12:49,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:49,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:49,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-16 12:12:49,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:49,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:12:50,489 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-16 12:12:50,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 57 [2022-11-16 12:12:50,520 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-16 12:12:50,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2022-11-16 12:12:51,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:51,145 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 12:12:51,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 101 [2022-11-16 12:12:51,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:12:51,171 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 12:12:51,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 110 [2022-11-16 12:12:51,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:12:51,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:12:52,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:12:52,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-16 12:12:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-16 12:12:52,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:12:52,633 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3044 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3044) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_3043 (Array Int Int)) (v_ArrVal_3044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3044) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3043) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-16 12:13:05,772 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3054 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3055 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3053))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (forall ((v_subst_1 Int)) (let ((.cse2 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3054))) (or (forall ((v_ArrVal_3043 (Array Int Int)) (v_ArrVal_3044 (Array Int Int))) (<= (+ (select (select (store (store .cse0 v_subst_1 (store (select .cse0 v_subst_1) .cse1 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3044) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select .cse2 (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3055))) (store .cse3 v_subst_1 (store (select .cse3 v_subst_1) .cse1 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3043) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (<= (+ 4 .cse1) (select .cse2 v_subst_1)))))) (not (<= 0 .cse1)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0)))) (not (<= 8 v_ArrVal_3054)))) (forall ((v_ArrVal_3054 Int)) (or (not (<= 8 v_ArrVal_3054)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3053 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3053))) (let ((.cse5 (select (select .cse4 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (forall ((v_subst_2 Int)) (or (forall ((v_ArrVal_3044 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store .cse4 v_subst_2 (store (select .cse4 v_subst_2) .cse5 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3044) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (<= (+ 4 .cse5) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3054) v_subst_2))))) (not (<= 0 .cse5)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0))))))) is different from false [2022-11-16 12:13:05,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909586856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:05,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:13:05,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 52 [2022-11-16 12:13:05,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698815434] [2022-11-16 12:13:05,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:13:05,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-16 12:13:05,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:05,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-16 12:13:05,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3343, Unknown=33, NotChecked=360, Total=4032 [2022-11-16 12:13:05,781 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand has 53 states, 50 states have (on average 1.98) internal successors, (99), 46 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:13:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:08,906 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2022-11-16 12:13:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 12:13:08,907 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.98) internal successors, (99), 46 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-11-16 12:13:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:08,908 INFO L225 Difference]: With dead ends: 165 [2022-11-16 12:13:08,908 INFO L226 Difference]: Without dead ends: 165 [2022-11-16 12:13:08,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1964 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=494, Invalid=5183, Unknown=35, NotChecked=450, Total=6162 [2022-11-16 12:13:08,909 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 92 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:08,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1164 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 753 Invalid, 0 Unknown, 295 Unchecked, 0.9s Time] [2022-11-16 12:13:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-16 12:13:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2022-11-16 12:13:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 148 states have internal predecessors, (161), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-16 12:13:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2022-11-16 12:13:08,915 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 56 [2022-11-16 12:13:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:08,915 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2022-11-16 12:13:08,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.98) internal successors, (99), 46 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:13:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2022-11-16 12:13:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:13:08,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:08,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:08,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-16 12:13:09,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 12:13:09,123 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:13:09,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1773529958, now seen corresponding path program 3 times [2022-11-16 12:13:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:09,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899753946] [2022-11-16 12:13:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:09,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:13:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:09,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:13:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:09,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:13:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:13:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-16 12:13:09,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:09,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899753946] [2022-11-16 12:13:09,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899753946] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:09,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563071248] [2022-11-16 12:13:09,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:13:09,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:09,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:09,282 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:09,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 12:13:09,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 12:13:09,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:13:09,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:13:09,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:13:09,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:13:09,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563071248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:09,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:13:09,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-16 12:13:09,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594567521] [2022-11-16 12:13:09,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:09,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:13:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:13:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:13:09,803 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:13:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:09,820 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-11-16 12:13:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:13:09,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-11-16 12:13:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:09,830 INFO L225 Difference]: With dead ends: 88 [2022-11-16 12:13:09,830 INFO L226 Difference]: Without dead ends: 88 [2022-11-16 12:13:09,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:13:09,831 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 64 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:09,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 103 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:13:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-16 12:13:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-16 12:13:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:13:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-11-16 12:13:09,837 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 58 [2022-11-16 12:13:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:09,838 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-11-16 12:13:09,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:13:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-11-16 12:13:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:13:09,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:09,839 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:09,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:13:10,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:10,053 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:13:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:10,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228282, now seen corresponding path program 1 times [2022-11-16 12:13:10,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:10,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514427101] [2022-11-16 12:13:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:10,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:13:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:11,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:13:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:11,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:13:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:13:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:11,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514427101] [2022-11-16 12:13:11,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514427101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:11,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471324998] [2022-11-16 12:13:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:11,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:11,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:11,398 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:11,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 12:13:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:11,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:13:11,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:12,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:13:12,107 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3442 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_3442) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:13:12,116 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3443 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_3443)))) is different from true [2022-11-16 12:13:12,126 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3443 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_3443) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:13:12,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:12,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:13:12,347 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:13:12,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-11-16 12:13:12,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:12,500 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 12:13:12,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2022-11-16 12:13:12,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:13:12,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:13:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:13:12,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:13:12,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471324998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:12,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:13:12,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [22] total 38 [2022-11-16 12:13:12,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284815058] [2022-11-16 12:13:12,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:12,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:13:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:12,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:13:12,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1149, Unknown=3, NotChecked=210, Total=1482 [2022-11-16 12:13:12,709 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:13:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:13,173 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-11-16 12:13:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:13:13,174 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-11-16 12:13:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:13,175 INFO L225 Difference]: With dead ends: 93 [2022-11-16 12:13:13,175 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 12:13:13,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=156, Invalid=1575, Unknown=3, NotChecked=246, Total=1980 [2022-11-16 12:13:13,177 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:13,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 553 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 284 Unchecked, 0.3s Time] [2022-11-16 12:13:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 12:13:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2022-11-16 12:13:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:13:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-11-16 12:13:13,181 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 58 [2022-11-16 12:13:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:13,181 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-11-16 12:13:13,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:13:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-11-16 12:13:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:13:13,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:13,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:13,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 12:13:13,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:13,391 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:13:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228283, now seen corresponding path program 1 times [2022-11-16 12:13:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:13,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954039402] [2022-11-16 12:13:13,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:13,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:13:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:13:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:17,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:13:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:13:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954039402] [2022-11-16 12:13:18,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954039402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696181302] [2022-11-16 12:13:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:18,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:18,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:18,566 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:18,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 12:13:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:18,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 143 conjunts are in the unsatisfiable core [2022-11-16 12:13:18,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:18,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:13:19,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:13:19,352 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:13:19,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:13:19,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:13:19,706 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 12:13:19,972 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 12:13:19,972 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 12:13:20,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:13:20,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:20,345 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 12:13:20,750 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:13:20,751 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 37 treesize of output 36 [2022-11-16 12:13:20,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 12:13:21,335 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:13:21,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 28 [2022-11-16 12:13:21,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:13:21,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:22,012 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 12:13:22,012 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 46 [2022-11-16 12:13:22,025 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:13:22,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 12:13:22,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-11-16 12:13:22,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:22,060 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 12:13:23,643 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 12:13:23,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 83 [2022-11-16 12:13:23,673 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:13:23,674 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 45 [2022-11-16 12:13:23,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:23,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-16 12:13:23,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:23,931 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:13:23,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 50 [2022-11-16 12:13:23,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 12:13:23,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:23,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:13:24,177 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:13:24,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2022-11-16 12:13:24,183 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 12:13:24,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:13:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:13:24,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:13:24,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-16 12:13:24,937 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-16 12:13:24,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-16 12:13:24,989 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-16 12:13:25,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-16 12:13:25,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-16 12:13:25,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-16 12:13:25,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| Int) (v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3656 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3657 (Array Int Int)) (v_ArrVal_3646 (Array Int Int)) (v_ArrVal_3658 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3658)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3657))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3656) .cse0 v_ArrVal_3643) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3646) (select (select (store (store .cse1 .cse0 v_ArrVal_3642) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_3641) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2022-11-16 12:13:25,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696181302] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:25,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:13:25,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33] total 66 [2022-11-16 12:13:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984157984] [2022-11-16 12:13:25,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:13:25,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-16 12:13:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:25,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-16 12:13:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=4461, Unknown=8, NotChecked=1128, Total=5852 [2022-11-16 12:13:25,243 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 66 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 57 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 12:13:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:36,556 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2022-11-16 12:13:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:13:36,557 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 57 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2022-11-16 12:13:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:36,558 INFO L225 Difference]: With dead ends: 109 [2022-11-16 12:13:36,558 INFO L226 Difference]: Without dead ends: 109 [2022-11-16 12:13:36,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=757, Invalid=8197, Unknown=8, NotChecked=1544, Total=10506 [2022-11-16 12:13:36,560 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 817 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:36,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1208 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-16 12:13:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-16 12:13:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2022-11-16 12:13:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:13:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-11-16 12:13:36,564 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 58 [2022-11-16 12:13:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:36,565 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-11-16 12:13:36,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 57 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 12:13:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-11-16 12:13:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 12:13:36,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:36,566 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:36,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-16 12:13:36,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 12:13:36,773 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:13:36,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478905, now seen corresponding path program 1 times [2022-11-16 12:13:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:36,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347352887] [2022-11-16 12:13:36,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:13:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:13:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:13:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:13:41,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:41,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347352887] [2022-11-16 12:13:41,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347352887] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:41,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170471776] [2022-11-16 12:13:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:41,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:41,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:41,487 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:41,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 12:13:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:41,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-16 12:13:41,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:41,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:13:41,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:13:42,233 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:13:42,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:13:42,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:13:42,736 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 12:13:42,736 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 12:13:43,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:13:43,392 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:13:43,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 12:13:43,919 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:13:43,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2022-11-16 12:13:43,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:13:44,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:44,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:13:44,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:44,740 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:13:44,741 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 42 [2022-11-16 12:13:44,761 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:13:44,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 12:13:46,392 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 12:13:46,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 73 [2022-11-16 12:13:46,417 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:13:46,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-11-16 12:13:46,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:46,662 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:13:46,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2022-11-16 12:13:46,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:46,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-16 12:13:46,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-16 12:13:47,347 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:13:47,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2022-11-16 12:13:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:13:47,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:13:47,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-16 12:13:48,338 INFO L321 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2022-11-16 12:13:48,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-11-16 12:13:48,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) is different from false [2022-11-16 12:13:48,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-16 12:13:48,376 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-16 12:13:48,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-16 12:13:48,428 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-16 12:13:48,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-16 12:13:49,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170471776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:49,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:13:49,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 33] total 69 [2022-11-16 12:13:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858079616] [2022-11-16 12:13:49,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:13:49,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-16 12:13:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:49,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-16 12:13:49,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=5307, Unknown=70, NotChecked=1064, Total=6642 [2022-11-16 12:13:49,067 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 70 states, 65 states have (on average 1.646153846153846) internal successors, (107), 61 states have internal predecessors, (107), 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 12:14:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:14:00,639 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2022-11-16 12:14:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 12:14:00,640 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 65 states have (on average 1.646153846153846) internal successors, (107), 61 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-11-16 12:14:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:14:00,640 INFO L225 Difference]: With dead ends: 123 [2022-11-16 12:14:00,640 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 12:14:00,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=620, Invalid=8644, Unknown=76, NotChecked=1372, Total=10712 [2022-11-16 12:14:00,649 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 383 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:14:00,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1610 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2636 Invalid, 0 Unknown, 166 Unchecked, 3.2s Time] [2022-11-16 12:14:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 12:14:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2022-11-16 12:14:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:14:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-11-16 12:14:00,660 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 62 [2022-11-16 12:14:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:14:00,661 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-11-16 12:14:00,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 65 states have (on average 1.646153846153846) internal successors, (107), 61 states have internal predecessors, (107), 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 12:14:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-11-16 12:14:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 12:14:00,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:14:00,663 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:00,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 12:14:00,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 12:14:00,870 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:14:00,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478904, now seen corresponding path program 1 times [2022-11-16 12:14:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:00,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293148602] [2022-11-16 12:14:00,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:00,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:14:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:04,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:14:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:04,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:14:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:14:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:05,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293148602] [2022-11-16 12:14:05,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293148602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:14:05,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781054796] [2022-11-16 12:14:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:05,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:14:05,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:14:05,302 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:14:05,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 12:14:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:05,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 150 conjunts are in the unsatisfiable core [2022-11-16 12:14:05,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:14:05,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:14:06,168 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:14:06,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:14:06,872 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 12:14:06,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-16 12:14:06,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:14:07,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:14:07,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:14:07,643 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:14:07,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2022-11-16 12:14:07,657 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 12:14:08,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:08,987 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:14:08,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 65 [2022-11-16 12:14:08,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:09,026 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-16 12:14:09,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 42 [2022-11-16 12:14:09,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:14:09,076 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-16 12:14:09,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 34 [2022-11-16 12:14:09,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:09,125 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-16 12:14:09,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-16 12:14:11,020 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 12:14:11,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2022-11-16 12:14:11,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:11,068 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-16 12:14:11,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2022-11-16 12:14:11,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:11,307 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 12:14:11,326 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:14:11,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 63 [2022-11-16 12:14:12,022 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-16 12:14:12,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2022-11-16 12:14:12,508 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:14:12,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-16 12:14:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:14:12,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:14:13,560 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4054 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4054))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_4053 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4053))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse0) 8) (select |c_#length| (select (select .cse3 .cse2) .cse0)))))))))) (forall ((v_ArrVal_4054 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4054))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_4053 (Array Int Int))) (<= 0 (+ (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4) 4)))))))) is different from false [2022-11-16 12:14:23,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781054796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:14:23,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:14:23,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 72 [2022-11-16 12:14:23,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906435797] [2022-11-16 12:14:23,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:14:23,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-16 12:14:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:23,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-16 12:14:23,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=6742, Unknown=101, NotChecked=166, Total=7310 [2022-11-16 12:14:23,136 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 73 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 63 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:14:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:14:36,848 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2022-11-16 12:14:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:14:36,849 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 63 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-11-16 12:14:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:14:36,850 INFO L225 Difference]: With dead ends: 127 [2022-11-16 12:14:36,850 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 12:14:36,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2064 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=671, Invalid=11222, Unknown=101, NotChecked=216, Total=12210 [2022-11-16 12:14:36,852 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 185 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:14:36,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1746 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2232 Invalid, 0 Unknown, 280 Unchecked, 4.3s Time] [2022-11-16 12:14:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 12:14:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2022-11-16 12:14:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.263157894736842) internal successors, (96), 90 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:14:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-11-16 12:14:36,857 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 62 [2022-11-16 12:14:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:14:36,857 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-11-16 12:14:36,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 63 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:14:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-11-16 12:14:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:14:36,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:14:36,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:36,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 12:14:37,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 12:14:37,066 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:14:37,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1350141375, now seen corresponding path program 1 times [2022-11-16 12:14:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:37,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641182193] [2022-11-16 12:14:37,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:14:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:40,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:14:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:14:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:14:41,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:41,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641182193] [2022-11-16 12:14:41,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641182193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:14:41,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118490573] [2022-11-16 12:14:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:41,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:14:41,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:14:41,705 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:14:41,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 12:14:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:42,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-16 12:14:42,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:14:42,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:14:42,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:14:42,706 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:14:42,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:14:43,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:14:43,411 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 12:14:43,411 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 12:14:43,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:14:44,290 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:14:44,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 12:14:44,996 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 12:14:44,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 21 [2022-11-16 12:14:46,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:46,135 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:14:46,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 56 [2022-11-16 12:14:46,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:46,146 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 43 treesize of output 43 [2022-11-16 12:14:46,182 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:14:46,183 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 12:14:48,117 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-16 12:14:48,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 54 [2022-11-16 12:14:48,152 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:14:48,153 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 74 treesize of output 73 [2022-11-16 12:14:48,561 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-16 12:14:48,561 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 134 treesize of output 95 [2022-11-16 12:14:48,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:14:48,576 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 80 treesize of output 76 [2022-11-16 12:14:48,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-11-16 12:14:49,010 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 108 treesize of output 84 [2022-11-16 12:14:50,601 INFO L321 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2022-11-16 12:14:50,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 135 treesize of output 93 [2022-11-16 12:14:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:14:50,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:14:50,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4257))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-16 12:14:51,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4254 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4257))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_4254) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-16 12:14:51,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4254 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4257))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4254) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-16 12:14:51,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4254 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4257))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4254) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-16 12:14:51,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4254 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4257))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4254) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-16 12:14:52,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4264 (Array Int Int)) (v_ArrVal_4265 (Array Int Int)) (v_ArrVal_4254 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| Int) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int)) (or (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4265)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4264))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4257))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store .cse2 .cse3 v_ArrVal_4254) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| |c_#StackHeapBarrier|)))) is different from false [2022-11-16 12:14:52,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118490573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:14:52,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:14:52,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 67 [2022-11-16 12:14:52,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935226375] [2022-11-16 12:14:52,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:14:52,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-16 12:14:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-16 12:14:52,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=4371, Unknown=117, NotChecked=834, Total=5550 [2022-11-16 12:14:52,117 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 67 states, 63 states have (on average 1.746031746031746) internal successors, (110), 58 states have internal predecessors, (110), 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 12:14:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:14:58,445 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-11-16 12:14:58,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 12:14:58,446 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 63 states have (on average 1.746031746031746) internal successors, (110), 58 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-11-16 12:14:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:14:58,447 INFO L225 Difference]: With dead ends: 96 [2022-11-16 12:14:58,447 INFO L226 Difference]: Without dead ends: 96 [2022-11-16 12:14:58,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=390, Invalid=6647, Unknown=127, NotChecked=1026, Total=8190 [2022-11-16 12:14:58,449 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 78 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:14:58,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1550 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1351 Invalid, 0 Unknown, 183 Unchecked, 2.5s Time] [2022-11-16 12:14:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-16 12:14:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-16 12:14:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.25) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:14:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-11-16 12:14:58,453 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 63 [2022-11-16 12:14:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:14:58,454 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-11-16 12:14:58,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 63 states have (on average 1.746031746031746) internal successors, (110), 58 states have internal predecessors, (110), 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 12:14:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-11-16 12:14:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-16 12:14:58,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:14:58,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:58,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-16 12:14:58,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:14:58,663 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:14:58,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1095322986, now seen corresponding path program 1 times [2022-11-16 12:14:58,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:58,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906562139] [2022-11-16 12:14:58,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:02,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:03,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:03,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:15:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:15:04,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:04,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906562139] [2022-11-16 12:15:04,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906562139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:04,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154593408] [2022-11-16 12:15:04,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:04,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:04,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:04,808 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:04,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 12:15:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:05,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 192 conjunts are in the unsatisfiable core [2022-11-16 12:15:05,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:05,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:15:05,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:15:05,737 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 12:15:06,153 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:15:06,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:15:06,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:15:07,684 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:15:07,685 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 16 treesize of output 22 [2022-11-16 12:15:07,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:15:07,770 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 12:15:07,771 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 12:15:08,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:15:08,347 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 12:15:08,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:15:09,065 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:15:09,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2022-11-16 12:15:09,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-16 12:15:09,090 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 12:15:10,066 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:15:10,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2022-11-16 12:15:10,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:15:11,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:15:11,161 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 12:15:11,162 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 62 [2022-11-16 12:15:11,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:15:11,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:15:11,222 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-16 12:15:11,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-11-16 12:15:11,307 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 12:15:11,307 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 12:15:11,329 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 24 treesize of output 19 [2022-11-16 12:15:15,309 INFO L321 Elim1Store]: treesize reduction 143, result has 15.4 percent of original size [2022-11-16 12:15:15,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 222 treesize of output 108 [2022-11-16 12:15:15,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:15:15,379 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-16 12:15:15,380 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 115 treesize of output 99 [2022-11-16 12:15:15,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:15:15,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:15:15,406 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 63 treesize of output 50 [2022-11-16 12:15:15,900 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 12:15:15,901 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 238 treesize of output 157 [2022-11-16 12:15:15,954 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 12:15:15,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 154 [2022-11-16 12:15:15,987 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 50 treesize of output 52 [2022-11-16 12:15:17,239 INFO L321 Elim1Store]: treesize reduction 44, result has 26.7 percent of original size [2022-11-16 12:15:17,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 74 [2022-11-16 12:15:17,945 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:15:17,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-16 12:15:18,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:15:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:15:18,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:15:19,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4471 (Array Int Int)) (v_ArrVal_4472 (Array Int Int)) (v_ArrVal_4470 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4470)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4472))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4471) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2022-11-16 12:15:19,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4471 (Array Int Int)) (v_ArrVal_4472 (Array Int Int)) (v_ArrVal_4468 (Array Int Int)) (v_ArrVal_4467 Int) (v_ArrVal_4470 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4468) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4470)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4472))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_4467)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4471) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2022-11-16 12:15:23,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4482 (Array Int Int)) (v_ArrVal_4471 (Array Int Int)) (v_ArrVal_4483 (Array Int Int)) (v_ArrVal_4472 (Array Int Int)) (v_ArrVal_4484 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| Int) (v_ArrVal_4468 (Array Int Int)) (v_ArrVal_4467 Int) (v_ArrVal_4470 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4482)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4483))) (let ((.cse10 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse11 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse7 .cse10) .cse11))) (let ((.cse8 (select .cse7 .cse1)) (.cse2 (select (select .cse9 .cse10) .cse11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store .cse9 .cse1 v_ArrVal_4468) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4470)) (.cse3 (store (store .cse7 .cse1 (store .cse8 .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4472))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4484))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4467))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4471) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48|) 0)) (not (= .cse10 (select .cse8 .cse2))))))))) is different from false [2022-11-16 12:15:23,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154593408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:23,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:15:23,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 41] total 74 [2022-11-16 12:15:23,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338599234] [2022-11-16 12:15:23,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:15:23,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-16 12:15:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:23,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-16 12:15:23,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=7140, Unknown=8, NotChecked=516, Total=8010 [2022-11-16 12:15:23,107 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 74 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 64 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:15:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:40,528 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-11-16 12:15:40,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 12:15:40,529 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 64 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-11-16 12:15:40,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:40,529 INFO L225 Difference]: With dead ends: 97 [2022-11-16 12:15:40,530 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 12:15:40,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 114 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2735 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=837, Invalid=11821, Unknown=10, NotChecked=672, Total=13340 [2022-11-16 12:15:40,531 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 226 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:40,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1991 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2478 Invalid, 0 Unknown, 133 Unchecked, 5.2s Time] [2022-11-16 12:15:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 12:15:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-11-16 12:15:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.236842105263158) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:15:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-11-16 12:15:40,535 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 64 [2022-11-16 12:15:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:40,536 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-11-16 12:15:40,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 64 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:15:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-11-16 12:15:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 12:15:40,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:40,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:40,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:40,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:40,746 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:15:40,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826698, now seen corresponding path program 2 times [2022-11-16 12:15:40,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:40,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393248931] [2022-11-16 12:15:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:46,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:47,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:15:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:15:48,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:48,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393248931] [2022-11-16 12:15:48,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393248931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:48,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857648981] [2022-11-16 12:15:48,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:15:48,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:48,545 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:48,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 12:15:48,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:15:48,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:15:48,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 160 conjunts are in the unsatisfiable core [2022-11-16 12:15:48,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:50,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-16 12:15:50,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:15:51,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:15:52,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:15:52,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:15:52,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-16 12:15:52,254 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:15:52,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 12:15:52,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:15:52,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:15:58,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:15:58,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:15:58,202 INFO L321 Elim1Store]: treesize reduction 123, result has 25.9 percent of original size [2022-11-16 12:15:58,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 209 treesize of output 132 [2022-11-16 12:15:58,273 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-16 12:15:58,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 97 [2022-11-16 12:15:59,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:16:00,040 INFO L321 Elim1Store]: treesize reduction 208, result has 29.0 percent of original size [2022-11-16 12:16:00,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 161 treesize of output 184 [2022-11-16 12:16:00,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:16:00,258 INFO L321 Elim1Store]: treesize reduction 128, result has 22.9 percent of original size [2022-11-16 12:16:00,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 160 treesize of output 143 [2022-11-16 12:16:05,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:16:05,858 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 197 treesize of output 215 [2022-11-16 12:16:09,375 INFO L321 Elim1Store]: treesize reduction 148, result has 54.5 percent of original size [2022-11-16 12:16:09,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 219 treesize of output 321 [2022-11-16 12:16:09,831 INFO L321 Elim1Store]: treesize reduction 64, result has 70.0 percent of original size [2022-11-16 12:16:09,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 240 treesize of output 310 [2022-11-16 12:16:21,620 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 12:16:21,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:16:23,117 INFO L321 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2022-11-16 12:16:23,119 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 96 treesize of output 95 [2022-11-16 12:16:32,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5913 treesize of output 4714 [2022-11-16 12:16:35,824 WARN L855 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4689 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse10 .cse0) .cse13))) (let ((.cse6 (select .cse10 .cse1)) (.cse7 (select (select .cse12 .cse0) .cse13))) (let ((.cse8 (let ((.cse11 (store .cse12 .cse1 (store (select .cse12 .cse1) .cse7 0)))) (store .cse11 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse11 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse11 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse2 (let ((.cse9 (store .cse10 .cse1 (store .cse6 .cse7 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse9 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse9 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse8 .cse3) .cse4))) (or (= .cse0 .cse1) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse2 (select (select .cse2 .cse3) .cse4)) .cse5)) (not (= .cse0 (select .cse6 .cse7))) (< 0 .cse5) (= .cse0 0) (not (<= 0 .cse7))))))))))) (not (<= 0 .cse13)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse21 (select (select .cse27 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4689 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse18 (select (select .cse24 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse25 (select (select .cse24 .cse18) .cse21))) (let ((.cse19 (select .cse24 .cse25)) (.cse20 (select (select .cse27 .cse18) .cse21))) (let ((.cse22 (let ((.cse26 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse20 0)))) (store .cse26 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse26 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse26 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse14 (let ((.cse23 (store .cse24 .cse25 (store .cse19 .cse20 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse23 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse23 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (select (select .cse22 .cse15) .cse16))) (or (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse14 (select (select .cse14 .cse15) .cse16)) .cse17)) (not (= .cse18 (select .cse19 .cse20))) (= .cse21 .cse20) (< 0 .cse17) (= .cse18 0) (not (<= 0 .cse20))))))))))) (not (<= 0 .cse21)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse28 (select (select .cse41 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= .cse28 0) (not (<= 0 .cse28)) (forall ((v_ArrVal_4689 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse29 (select (select .cse39 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse30 (select (select .cse39 .cse29) .cse28))) (let ((.cse35 (select .cse39 .cse30)) (.cse36 (select (select .cse41 .cse29) .cse28))) (let ((.cse37 (let ((.cse40 (store .cse41 .cse30 (store (select .cse41 .cse30) .cse36 0)))) (store .cse40 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse40 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse40 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse31 (let ((.cse38 (store .cse39 .cse30 (store .cse35 .cse36 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse38 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse38 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse38 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse33 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select (select .cse37 .cse32) .cse33))) (or (= .cse29 .cse30) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse31 (select (select .cse31 .cse32) .cse33)) .cse34)) (not (= .cse29 (select .cse35 .cse36))) (< 0 .cse34) (not (<= 0 .cse36))))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse55 (select (select .cse54 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4689 Int)) (let ((.cse52 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse43 (select (select .cse52 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse44 (select (select .cse52 .cse43) .cse55))) (let ((.cse49 (select .cse52 .cse44)) (.cse50 (select (select .cse54 .cse43) .cse55))) (let ((.cse46 (let ((.cse53 (store .cse54 .cse44 (store (select .cse54 .cse44) .cse50 0)))) (store .cse53 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse53 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse53 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse45 (let ((.cse51 (store .cse52 .cse44 (store .cse49 .cse50 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse51 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse51 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse51 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse47 (select (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse48 (select (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (select (select .cse45 .cse47) .cse48))) (or (= .cse42 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) (= .cse43 .cse44) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse45 .cse42) (select (select .cse46 .cse47) .cse48))) (not (= .cse43 (select .cse49 .cse50))) (= .cse43 0) (not (<= 0 .cse50))))))))))) (not (<= 0 .cse55)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse56 (select (select .cse69 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= .cse56 0) (not (<= 0 .cse56)) (forall ((v_ArrVal_4689 Int)) (let ((.cse67 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse58 (select (select .cse67 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse59 (select (select .cse67 .cse58) .cse56))) (let ((.cse64 (select .cse67 .cse59)) (.cse65 (select (select .cse69 .cse58) .cse56))) (let ((.cse61 (let ((.cse68 (store .cse69 .cse59 (store (select .cse69 .cse59) .cse65 0)))) (store .cse68 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse68 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse68 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse60 (let ((.cse66 (store .cse67 .cse59 (store .cse64 .cse65 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse66 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse66 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse66 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse62 (select (select .cse60 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse63 (select (select .cse61 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse57 (select (select .cse60 .cse62) .cse63))) (or (= .cse57 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) (= .cse58 .cse59) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse60 .cse57) (select (select .cse61 .cse62) .cse63))) (not (= .cse58 (select .cse64 .cse65))) (not (<= 0 .cse65))))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse83 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse70 (select (select .cse83 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= .cse70 0) (forall ((v_ArrVal_4689 Int)) (let ((.cse80 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse76 (select (select .cse80 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse81 (select (select .cse80 .cse76) .cse70))) (let ((.cse77 (select .cse80 .cse81)) (.cse78 (select (select .cse83 .cse76) .cse70))) (let ((.cse73 (let ((.cse82 (store .cse83 .cse81 (store (select .cse83 .cse81) .cse78 0)))) (store .cse82 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse82 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse82 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse72 (let ((.cse79 (store .cse80 .cse81 (store .cse77 .cse78 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse79 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse79 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse79 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse74 (select (select .cse72 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse75 (select (select .cse73 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse71 (select (select .cse72 .cse74) .cse75))) (or (= .cse71 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse72 .cse71) (select (select .cse73 .cse74) .cse75))) (not (= .cse76 (select .cse77 .cse78))) (= .cse70 .cse78) (not (<= 0 .cse78))))))))))) (not (<= 0 .cse70)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse97 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse84 (select (select .cse97 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse84)) (forall ((v_ArrVal_4689 Int)) (let ((.cse94 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse90 (select (select .cse94 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse95 (select (select .cse94 .cse90) .cse84))) (let ((.cse91 (select .cse94 .cse95)) (.cse92 (select (select .cse97 .cse90) .cse84))) (let ((.cse87 (let ((.cse96 (store .cse97 .cse95 (store (select .cse97 .cse95) .cse92 0)))) (store .cse96 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse96 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse96 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse86 (let ((.cse93 (store .cse94 .cse95 (store .cse91 .cse92 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse93 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse93 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse93 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse88 (select (select .cse86 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse89 (select (select .cse87 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse85 (select (select .cse86 .cse88) .cse89))) (or (= .cse85 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse86 .cse85) (select (select .cse87 .cse88) .cse89))) (not (= .cse90 (select .cse91 .cse92))) (= .cse84 .cse92) (= .cse90 0) (not (<= 0 .cse92))))))))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse111 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse98 (select (select .cse111 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= .cse98 0) (forall ((v_ArrVal_4689 Int)) (let ((.cse108 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse103 (select (select .cse108 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse109 (select (select .cse108 .cse103) .cse98))) (let ((.cse104 (select .cse108 .cse109)) (.cse105 (select (select .cse111 .cse103) .cse98))) (let ((.cse106 (let ((.cse110 (store .cse111 .cse109 (store (select .cse111 .cse109) .cse105 0)))) (store .cse110 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse110 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse110 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse99 (let ((.cse107 (store .cse108 .cse109 (store .cse104 .cse105 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse107 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse107 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse107 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse100 (select (select .cse99 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse101 (select (select .cse106 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse102 (select (select .cse106 .cse100) .cse101))) (or (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse99 (select (select .cse99 .cse100) .cse101)) .cse102)) (not (= .cse103 (select .cse104 .cse105))) (= .cse98 .cse105) (< 0 .cse102) (not (<= 0 .cse105))))))))))) (not (<= 0 .cse98)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|))))) is different from true [2022-11-16 12:16:35,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857648981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:16:35,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:16:35,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 40] total 82 [2022-11-16 12:16:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229392146] [2022-11-16 12:16:35,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:16:35,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-16 12:16:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:16:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-16 12:16:35,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=10271, Unknown=1, NotChecked=204, Total=10920 [2022-11-16 12:16:35,832 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 83 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 76 states have internal predecessors, (121), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:16:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:50,364 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2022-11-16 12:16:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-16 12:16:50,365 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 76 states have internal predecessors, (121), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 68 [2022-11-16 12:16:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:50,366 INFO L225 Difference]: With dead ends: 133 [2022-11-16 12:16:50,366 INFO L226 Difference]: Without dead ends: 133 [2022-11-16 12:16:50,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3545 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=860, Invalid=16965, Unknown=1, NotChecked=264, Total=18090 [2022-11-16 12:16:50,368 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 145 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:50,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1625 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2181 Invalid, 0 Unknown, 404 Unchecked, 4.1s Time] [2022-11-16 12:16:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-16 12:16:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 100. [2022-11-16 12:16:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.25) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:16:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-11-16 12:16:50,372 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 68 [2022-11-16 12:16:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:50,373 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-11-16 12:16:50,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 76 states have internal predecessors, (121), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:16:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-11-16 12:16:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 12:16:50,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:50,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:16:50,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-16 12:16:50,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-16 12:16:50,581 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:16:50,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826697, now seen corresponding path program 2 times [2022-11-16 12:16:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:16:50,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649500331] [2022-11-16 12:16:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:16:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:54,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:16:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:55,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:16:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:55,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:16:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:16:56,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:16:56,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649500331] [2022-11-16 12:16:56,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649500331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:16:56,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835821979] [2022-11-16 12:16:56,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:16:56,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:16:56,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:16:56,836 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:16:56,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 12:16:57,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:16:57,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:16:57,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 164 conjunts are in the unsatisfiable core [2022-11-16 12:16:57,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:57,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:16:57,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:16:58,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 12:16:58,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:17:00,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:00,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:17:00,233 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:17:00,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 12:17:00,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:17:00,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:00,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:17:03,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:17:03,907 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-16 12:17:03,907 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 168 treesize of output 111 [2022-11-16 12:17:03,970 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-16 12:17:03,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 84 [2022-11-16 12:17:05,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:05,380 INFO L321 Elim1Store]: treesize reduction 160, result has 48.9 percent of original size [2022-11-16 12:17:05,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 167 treesize of output 254 [2022-11-16 12:17:05,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:05,535 INFO L321 Elim1Store]: treesize reduction 140, result has 26.3 percent of original size [2022-11-16 12:17:05,536 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 330 treesize of output 232 [2022-11-16 12:17:19,001 INFO L321 Elim1Store]: treesize reduction 240, result has 39.5 percent of original size [2022-11-16 12:17:19,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 13 new quantified variables, introduced 28 case distinctions, treesize of input 312 treesize of output 335 [2022-11-16 12:17:19,425 INFO L321 Elim1Store]: treesize reduction 68, result has 64.0 percent of original size [2022-11-16 12:17:19,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 17 case distinctions, treesize of input 313 treesize of output 297 [2022-11-16 12:17:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:17:23,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:57,028 WARN L233 SmtUtils]: Spent 10.60s on a formula simplification. DAG size of input: 129 DAG size of output: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:18:57,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835821979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:57,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:18:57,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 75 [2022-11-16 12:18:57,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027304765] [2022-11-16 12:18:57,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:57,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-16 12:18:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:57,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-16 12:18:57,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=9655, Unknown=3, NotChecked=0, Total=10100 [2022-11-16 12:18:57,036 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 76 states, 72 states have (on average 1.7083333333333333) internal successors, (123), 69 states have internal predecessors, (123), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:19:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:28,787 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-11-16 12:19:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 12:19:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 72 states have (on average 1.7083333333333333) internal successors, (123), 69 states have internal predecessors, (123), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 68 [2022-11-16 12:19:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:28,789 INFO L225 Difference]: With dead ends: 100 [2022-11-16 12:19:28,789 INFO L226 Difference]: Without dead ends: 100 [2022-11-16 12:19:28,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3619 ImplicationChecksByTransitivity, 134.1s TimeCoverageRelationStatistics Valid=867, Invalid=17488, Unknown=5, NotChecked=0, Total=18360 [2022-11-16 12:19:28,792 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 76 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:28,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1982 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1741 Invalid, 0 Unknown, 338 Unchecked, 3.6s Time] [2022-11-16 12:19:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-16 12:19:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-16 12:19:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.2375) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:19:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2022-11-16 12:19:28,796 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 68 [2022-11-16 12:19:28,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:28,797 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2022-11-16 12:19:28,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 72 states have (on average 1.7083333333333333) internal successors, (123), 69 states have internal predecessors, (123), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:19:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-11-16 12:19:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-16 12:19:28,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:28,798 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:28,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-16 12:19:29,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:29,006 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-16 12:19:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1057077042, now seen corresponding path program 1 times [2022-11-16 12:19:29,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:29,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500583337] [2022-11-16 12:19:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:29,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:33,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:19:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:34,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:19:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:19:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:35,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500583337] [2022-11-16 12:19:35,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500583337] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:35,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657251472] [2022-11-16 12:19:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:35,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:35,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:19:35,502 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:19:35,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec41e87-8d1c-4b6a-b6f5-ca197f79c145/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-16 12:19:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:35,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 189 conjunts are in the unsatisfiable core [2022-11-16 12:19:35,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:19:35,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:19:35,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:19:36,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:19:36,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:19:36,732 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:19:36,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:19:36,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:19:37,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 12:19:37,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:37,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:19:39,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-16 12:19:39,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:19:39,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:39,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:19:39,724 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 12:19:41,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:41,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:41,243 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 50 treesize of output 41 [2022-11-16 12:19:41,266 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:19:41,267 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 12:19:41,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:41,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:41,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 26 [2022-11-16 12:19:41,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:41,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:19:47,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:47,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:19:47,444 INFO L321 Elim1Store]: treesize reduction 127, result has 23.5 percent of original size [2022-11-16 12:19:47,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 258 treesize of output 153 [2022-11-16 12:19:47,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:47,512 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-16 12:19:47,513 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 3 case distinctions, treesize of input 173 treesize of output 104 [2022-11-16 12:19:49,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:49,758 INFO L321 Elim1Store]: treesize reduction 256, result has 29.1 percent of original size [2022-11-16 12:19:49,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 287 treesize of output 274 [2022-11-16 12:19:49,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:49,986 INFO L321 Elim1Store]: treesize reduction 152, result has 20.0 percent of original size [2022-11-16 12:19:49,986 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 292 treesize of output 218 [2022-11-16 12:19:56,440 INFO L321 Elim1Store]: treesize reduction 92, result has 70.2 percent of original size [2022-11-16 12:19:56,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 268 treesize of output 406