./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:13:03,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:13:03,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:13:04,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:13:04,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:13:04,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:13:04,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:13:04,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:13:04,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:13:04,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:13:04,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:13:04,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:13:04,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:13:04,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:13:04,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:13:04,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:13:04,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:13:04,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:13:04,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:13:04,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:13:04,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:13:04,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:13:04,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:13:04,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:13:04,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:13:04,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:13:04,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:13:04,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:13:04,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:13:04,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:13:04,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:13:04,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:13:04,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:13:04,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:13:04,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:13:04,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:13:04,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:13:04,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:13:04,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:13:04,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:13:04,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:13:04,123 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:13:04,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:13:04,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:13:04,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:13:04,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:13:04,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:13:04,160 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:13:04,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:13:04,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:13:04,161 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:13:04,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:13:04,163 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:13:04,163 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:13:04,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:13:04,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:13:04,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:13:04,164 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:13:04,164 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:13:04,165 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:13:04,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:13:04,165 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:13:04,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:13:04,166 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:13:04,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:13:04,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:13:04,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:13:04,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:13:04,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:13:04,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:13:04,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:13:04,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:13:04,170 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_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-11-18 20:13:04,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:13:04,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:13:04,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:13:04,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:13:04,553 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:13:04,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-18 20:13:04,643 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/data/014cce8d4/a82df93c36b64d83a43c7c9c03b43fab/FLAG2f5d3002a [2022-11-18 20:13:05,250 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:13:05,250 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-18 20:13:05,265 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/data/014cce8d4/a82df93c36b64d83a43c7c9c03b43fab/FLAG2f5d3002a [2022-11-18 20:13:05,523 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/data/014cce8d4/a82df93c36b64d83a43c7c9c03b43fab [2022-11-18 20:13:05,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:13:05,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:13:05,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:13:05,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:13:05,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:13:05,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:13:05" (1/1) ... [2022-11-18 20:13:05,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74087d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:05, skipping insertion in model container [2022-11-18 20:13:05,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:13:05" (1/1) ... [2022-11-18 20:13:05,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:13:05,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:13:05,992 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-18 20:13:05,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:13:06,005 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:13:06,077 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-18 20:13:06,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:13:06,131 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:13:06,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06 WrapperNode [2022-11-18 20:13:06,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:13:06,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:13:06,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:13:06,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:13:06,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,224 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2022-11-18 20:13:06,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:13:06,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:13:06,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:13:06,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:13:06,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,281 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:13:06,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:13:06,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:13:06,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:13:06,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (1/1) ... [2022-11-18 20:13:06,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:13:06,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:06,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:13:06,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:13:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:13:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:13:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:13:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:13:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:13:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:13:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:13:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:13:06,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:13:06,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:13:06,536 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:13:06,538 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:13:06,970 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:13:06,978 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:13:06,990 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-18 20:13:06,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:13:06 BoogieIcfgContainer [2022-11-18 20:13:06,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:13:06,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:13:06,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:13:07,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:13:07,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:13:05" (1/3) ... [2022-11-18 20:13:07,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68aeb25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:13:07, skipping insertion in model container [2022-11-18 20:13:07,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:13:06" (2/3) ... [2022-11-18 20:13:07,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68aeb25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:13:07, skipping insertion in model container [2022-11-18 20:13:07,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:13:06" (3/3) ... [2022-11-18 20:13:07,011 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-18 20:13:07,037 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:13:07,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-18 20:13:07,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:13:07,162 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;@1f8a383e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:13:07,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-18 20:13:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:07,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:13:07,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:07,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:13:07,185 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:07,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:07,198 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2022-11-18 20:13:07,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:07,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332791650] [2022-11-18 20:13:07,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:07,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:07,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332791650] [2022-11-18 20:13:07,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332791650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:07,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:07,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:13:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437263526] [2022-11-18 20:13:07,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:07,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:13:07,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:07,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:13:07,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:13:07,670 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:07,791 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-18 20:13:07,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:13:07,795 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 20:13:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:07,805 INFO L225 Difference]: With dead ends: 109 [2022-11-18 20:13:07,806 INFO L226 Difference]: Without dead ends: 104 [2022-11-18 20:13:07,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:13:07,812 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:07,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:13:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-18 20:13:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-18 20:13:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-18 20:13:07,861 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2022-11-18 20:13:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:07,862 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-18 20:13:07,862 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-18 20:13:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:13:07,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:07,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:13:07,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:13:07,864 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:07,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2022-11-18 20:13:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:07,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864269320] [2022-11-18 20:13:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:07,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:08,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:08,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864269320] [2022-11-18 20:13:08,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864269320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:08,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:08,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:13:08,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001529208] [2022-11-18 20:13:08,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:08,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:13:08,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:08,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:13:08,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:13:08,037 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:08,123 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-18 20:13:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:13:08,124 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 20:13:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:08,126 INFO L225 Difference]: With dead ends: 102 [2022-11-18 20:13:08,126 INFO L226 Difference]: Without dead ends: 102 [2022-11-18 20:13:08,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:13:08,128 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:08,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:13:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-18 20:13:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-11-18 20:13:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-18 20:13:08,137 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2022-11-18 20:13:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:08,137 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-18 20:13:08,137 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-18 20:13:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 20:13:08,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:08,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:08,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:13:08,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2022-11-18 20:13:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:08,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991703677] [2022-11-18 20:13:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:08,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:08,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991703677] [2022-11-18 20:13:08,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991703677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:08,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:08,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:13:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636812194] [2022-11-18 20:13:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:08,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:13:08,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:08,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:13:08,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:13:08,260 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:08,280 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-11-18 20:13:08,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:13:08,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-18 20:13:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:08,282 INFO L225 Difference]: With dead ends: 68 [2022-11-18 20:13:08,289 INFO L226 Difference]: Without dead ends: 68 [2022-11-18 20:13:08,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:13:08,291 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:08,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:13:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-18 20:13:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-11-18 20:13:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-18 20:13:08,305 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2022-11-18 20:13:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:08,306 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-18 20:13:08,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-18 20:13:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:13:08,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:08,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:08,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:13:08,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:08,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2022-11-18 20:13:08,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:08,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927406396] [2022-11-18 20:13:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:08,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:08,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:08,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927406396] [2022-11-18 20:13:08,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927406396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:08,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:08,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:13:08,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806938226] [2022-11-18 20:13:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:08,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:13:08,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:08,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:13:08,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:13:08,521 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:08,733 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-18 20:13:08,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:13:08,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 20:13:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:08,735 INFO L225 Difference]: With dead ends: 76 [2022-11-18 20:13:08,735 INFO L226 Difference]: Without dead ends: 76 [2022-11-18 20:13:08,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:13:08,737 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:08,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:13:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-18 20:13:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-11-18 20:13:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-18 20:13:08,745 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2022-11-18 20:13:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:08,745 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-18 20:13:08,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-18 20:13:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:13:08,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:08,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:08,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:13:08,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:08,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2022-11-18 20:13:08,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:08,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106794515] [2022-11-18 20:13:08,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:08,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:08,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106794515] [2022-11-18 20:13:08,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106794515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:08,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:08,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:13:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885772492] [2022-11-18 20:13:08,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:08,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:13:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:08,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:13:08,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:13:08,949 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:09,070 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-18 20:13:09,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:13:09,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 20:13:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:09,079 INFO L225 Difference]: With dead ends: 61 [2022-11-18 20:13:09,080 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 20:13:09,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:13:09,089 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:09,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:13:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 20:13:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-18 20:13:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-11-18 20:13:09,111 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2022-11-18 20:13:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:09,111 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-11-18 20:13:09,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-11-18 20:13:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:13:09,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:09,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:09,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:13:09,116 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:09,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:09,117 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2022-11-18 20:13:09,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:09,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959977783] [2022-11-18 20:13:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:09,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:09,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959977783] [2022-11-18 20:13:09,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959977783] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:09,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197604866] [2022-11-18 20:13:09,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:09,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:09,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:09,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:09,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:13:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:09,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:13:09,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:09,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:09,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197604866] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:09,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:09,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-18 20:13:09,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220194443] [2022-11-18 20:13:09,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:09,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:13:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:13:09,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:13:09,609 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:09,628 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-18 20:13:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:13:09,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-18 20:13:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:09,630 INFO L225 Difference]: With dead ends: 65 [2022-11-18 20:13:09,630 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:13:09,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:13:09,641 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:09,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:13:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:13:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-18 20:13:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-18 20:13:09,659 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2022-11-18 20:13:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:09,660 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-18 20:13:09,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-18 20:13:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:13:09,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:09,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:09,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:09,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 20:13:09,869 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2022-11-18 20:13:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:09,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071878592] [2022-11-18 20:13:09,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:13:10,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:10,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071878592] [2022-11-18 20:13:10,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071878592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:10,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:10,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:13:10,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159064465] [2022-11-18 20:13:10,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:10,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:13:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:10,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:13:10,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:13:10,187 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:10,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:10,571 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-18 20:13:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:13:10,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-18 20:13:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:10,572 INFO L225 Difference]: With dead ends: 116 [2022-11-18 20:13:10,573 INFO L226 Difference]: Without dead ends: 116 [2022-11-18 20:13:10,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:13:10,574 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 380 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:10,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 141 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:13:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-18 20:13:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2022-11-18 20:13:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-18 20:13:10,581 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2022-11-18 20:13:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:10,581 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-18 20:13:10,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-18 20:13:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:13:10,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:10,583 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:10,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:13:10,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:10,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2022-11-18 20:13:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:10,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042713628] [2022-11-18 20:13:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:10,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:13:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:10,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042713628] [2022-11-18 20:13:10,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042713628] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:10,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346645200] [2022-11-18 20:13:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:10,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:10,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:10,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:13:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:10,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:13:10,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-18 20:13:11,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:13:11,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346645200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:11,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:13:11,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-18 20:13:11,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899368547] [2022-11-18 20:13:11,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:11,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:13:11,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:11,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:13:11,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:13:11,104 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:11,194 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-11-18 20:13:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:13:11,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-18 20:13:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:11,195 INFO L225 Difference]: With dead ends: 96 [2022-11-18 20:13:11,196 INFO L226 Difference]: Without dead ends: 96 [2022-11-18 20:13:11,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:13:11,197 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 110 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:11,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 151 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:13:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-18 20:13:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-11-18 20:13:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-11-18 20:13:11,210 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2022-11-18 20:13:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:11,210 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-11-18 20:13:11,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-11-18 20:13:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:13:11,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:11,212 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:11,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:11,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:11,425 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:11,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2022-11-18 20:13:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:11,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815846671] [2022-11-18 20:13:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:13:11,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:11,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815846671] [2022-11-18 20:13:11,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815846671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:11,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:11,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:13:11,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874935299] [2022-11-18 20:13:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:11,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:13:11,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:11,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:13:11,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:13:11,902 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:12,329 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-11-18 20:13:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:13:12,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-18 20:13:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:12,331 INFO L225 Difference]: With dead ends: 107 [2022-11-18 20:13:12,331 INFO L226 Difference]: Without dead ends: 107 [2022-11-18 20:13:12,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:13:12,332 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 366 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:12,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 106 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:13:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-18 20:13:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2022-11-18 20:13:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-18 20:13:12,351 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2022-11-18 20:13:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:12,352 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-18 20:13:12,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-18 20:13:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:13:12,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:12,353 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:12,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:13:12,354 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2022-11-18 20:13:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:12,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268543200] [2022-11-18 20:13:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:13,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:13,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268543200] [2022-11-18 20:13:13,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268543200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:13,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447139874] [2022-11-18 20:13:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:13,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:13,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:13,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:13,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:13:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:13,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-18 20:13:13,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:13,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:13:13,685 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:13:13,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-18 20:13:13,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:13:14,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-18 20:13:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:14,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:14,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447139874] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:14,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:14,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-11-18 20:13:14,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379448725] [2022-11-18 20:13:14,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:14,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-18 20:13:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:14,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-18 20:13:14,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-11-18 20:13:14,516 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:16,170 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-11-18 20:13:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:13:16,171 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:13:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:16,173 INFO L225 Difference]: With dead ends: 105 [2022-11-18 20:13:16,173 INFO L226 Difference]: Without dead ends: 105 [2022-11-18 20:13:16,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2022-11-18 20:13:16,174 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 833 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:16,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 491 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:13:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-18 20:13:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2022-11-18 20:13:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-18 20:13:16,180 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2022-11-18 20:13:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:16,180 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-18 20:13:16,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-18 20:13:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:13:16,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:16,182 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:16,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:16,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:13:16,388 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:16,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:16,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2022-11-18 20:13:16,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:16,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515052550] [2022-11-18 20:13:16,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:17,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:17,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515052550] [2022-11-18 20:13:17,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515052550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:17,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879717122] [2022-11-18 20:13:17,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:17,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:17,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:17,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:17,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:13:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:17,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-18 20:13:17,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:17,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:13:18,029 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:13:18,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:13:18,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:13:18,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:13:18,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:13:18,581 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 39 treesize of output 21 [2022-11-18 20:13:18,587 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 32 treesize of output 14 [2022-11-18 20:13:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:18,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:20,012 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 48 treesize of output 44 [2022-11-18 20:13:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:20,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879717122] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:20,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:20,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 43 [2022-11-18 20:13:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358592897] [2022-11-18 20:13:20,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:20,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-18 20:13:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-18 20:13:20,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1772, Unknown=0, NotChecked=0, Total=1892 [2022-11-18 20:13:20,141 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:26,232 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2022-11-18 20:13:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:13:26,233 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:13:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:26,234 INFO L225 Difference]: With dead ends: 213 [2022-11-18 20:13:26,235 INFO L226 Difference]: Without dead ends: 213 [2022-11-18 20:13:26,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=818, Invalid=3738, Unknown=0, NotChecked=0, Total=4556 [2022-11-18 20:13:26,237 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2932 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2932 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:26,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2932 Valid, 904 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1109 Invalid, 0 Unknown, 102 Unchecked, 1.3s Time] [2022-11-18 20:13:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-18 20:13:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 84. [2022-11-18 20:13:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.391304347826087) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-11-18 20:13:26,242 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2022-11-18 20:13:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:26,242 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-11-18 20:13:26,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-11-18 20:13:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:13:26,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:26,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:26,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:26,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:26,451 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2022-11-18 20:13:26,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:26,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032674850] [2022-11-18 20:13:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:26,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:13:26,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032674850] [2022-11-18 20:13:26,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032674850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991136148] [2022-11-18 20:13:26,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:13:26,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:26,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:26,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:26,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:13:26,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:13:26,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:13:26,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:13:26,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-18 20:13:26,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:13:26,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991136148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:26,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:13:26,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-18 20:13:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52724354] [2022-11-18 20:13:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:26,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:13:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:26,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:13:26,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:13:26,837 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:26,886 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-18 20:13:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:13:26,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-18 20:13:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:26,887 INFO L225 Difference]: With dead ends: 70 [2022-11-18 20:13:26,887 INFO L226 Difference]: Without dead ends: 70 [2022-11-18 20:13:26,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:13:26,888 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 125 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:26,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 86 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:13:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-18 20:13:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-18 20:13:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.293103448275862) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-18 20:13:26,892 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 32 [2022-11-18 20:13:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:26,893 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-18 20:13:26,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-18 20:13:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:13:26,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:26,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:26,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:27,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:13:27,106 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:27,107 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2022-11-18 20:13:27,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:27,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14375274] [2022-11-18 20:13:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:13:27,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:27,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14375274] [2022-11-18 20:13:27,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14375274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:27,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:27,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:13:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056401121] [2022-11-18 20:13:27,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:27,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:13:27,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:27,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:13:27,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:13:27,277 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:27,516 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-18 20:13:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:13:27,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-18 20:13:27,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:27,518 INFO L225 Difference]: With dead ends: 89 [2022-11-18 20:13:27,518 INFO L226 Difference]: Without dead ends: 89 [2022-11-18 20:13:27,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:13:27,519 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 338 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:27,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 109 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:13:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-18 20:13:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2022-11-18 20:13:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 72 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-11-18 20:13:27,522 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 36 [2022-11-18 20:13:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:27,522 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-11-18 20:13:27,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-11-18 20:13:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:13:27,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:27,523 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:27,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:13:27,523 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:27,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:27,524 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2022-11-18 20:13:27,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:27,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676248505] [2022-11-18 20:13:27,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:27,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:13:27,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:27,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676248505] [2022-11-18 20:13:27,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676248505] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:27,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880912237] [2022-11-18 20:13:27,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:27,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:27,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:27,654 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:27,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:13:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:27,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:13:27,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:13:27,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:13:27,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880912237] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:27,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:27,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-18 20:13:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259266037] [2022-11-18 20:13:27,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:27,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:13:27,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:27,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:13:27,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:13:27,929 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:27,980 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-11-18 20:13:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:13:27,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-18 20:13:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:27,982 INFO L225 Difference]: With dead ends: 95 [2022-11-18 20:13:27,983 INFO L226 Difference]: Without dead ends: 95 [2022-11-18 20:13:27,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:13:27,984 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 130 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:27,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 143 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:13:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-18 20:13:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-11-18 20:13:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 88 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2022-11-18 20:13:27,988 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 36 [2022-11-18 20:13:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:27,989 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2022-11-18 20:13:27,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2022-11-18 20:13:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 20:13:27,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:27,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:28,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 20:13:28,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:13:28,200 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2022-11-18 20:13:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:28,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430109321] [2022-11-18 20:13:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:28,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:13:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:28,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430109321] [2022-11-18 20:13:28,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430109321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:28,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487897999] [2022-11-18 20:13:28,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:28,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:28,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:28,421 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:28,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:13:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:28,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:13:28,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:13:28,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:13:28,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487897999] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:28,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:28,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-18 20:13:28,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910325257] [2022-11-18 20:13:28,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:28,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:13:28,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:28,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:13:28,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:13:28,771 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:28,852 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-11-18 20:13:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:13:28,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-18 20:13:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:28,853 INFO L225 Difference]: With dead ends: 90 [2022-11-18 20:13:28,853 INFO L226 Difference]: Without dead ends: 90 [2022-11-18 20:13:28,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:13:28,854 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 148 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:28,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 164 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:13:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-18 20:13:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-11-18 20:13:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.36986301369863) internal successors, (100), 83 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2022-11-18 20:13:28,857 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 37 [2022-11-18 20:13:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:28,857 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2022-11-18 20:13:28,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-11-18 20:13:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 20:13:28,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:28,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:28,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:29,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:13:29,063 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2022-11-18 20:13:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:29,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099933067] [2022-11-18 20:13:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:13:29,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:29,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099933067] [2022-11-18 20:13:29,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099933067] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:29,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070527799] [2022-11-18 20:13:29,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:13:29,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:29,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:29,225 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:29,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:13:29,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:13:29,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:13:29,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:13:29,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-18 20:13:29,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:13:29,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070527799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:29,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:13:29,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-18 20:13:29,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495586586] [2022-11-18 20:13:29,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:29,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:13:29,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:29,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:13:29,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:13:29,488 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:29,548 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-18 20:13:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:13:29,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-18 20:13:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:29,550 INFO L225 Difference]: With dead ends: 89 [2022-11-18 20:13:29,550 INFO L226 Difference]: Without dead ends: 89 [2022-11-18 20:13:29,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:13:29,551 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:29,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 136 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:13:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-18 20:13:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-11-18 20:13:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-11-18 20:13:29,558 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2022-11-18 20:13:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:29,559 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-11-18 20:13:29,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-11-18 20:13:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 20:13:29,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:29,561 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:29,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:29,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:13:29,768 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2022-11-18 20:13:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:29,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396353390] [2022-11-18 20:13:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:29,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:13:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:30,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396353390] [2022-11-18 20:13:30,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396353390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:30,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:13:30,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:13:30,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668508686] [2022-11-18 20:13:30,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:30,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:13:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:30,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:13:30,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:13:30,112 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:30,438 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-11-18 20:13:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:13:30,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-18 20:13:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:30,440 INFO L225 Difference]: With dead ends: 107 [2022-11-18 20:13:30,440 INFO L226 Difference]: Without dead ends: 107 [2022-11-18 20:13:30,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:13:30,446 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 414 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:30,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 80 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:13:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-18 20:13:30,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2022-11-18 20:13:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-11-18 20:13:30,453 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2022-11-18 20:13:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:30,454 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-11-18 20:13:30,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-11-18 20:13:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-18 20:13:30,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:30,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:30,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:13:30,456 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:30,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2022-11-18 20:13:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:30,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931270973] [2022-11-18 20:13:30,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:13:31,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:31,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931270973] [2022-11-18 20:13:31,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931270973] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:31,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942741668] [2022-11-18 20:13:31,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:31,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:31,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:32,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:13:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:32,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-18 20:13:32,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:32,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:13:32,277 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:13:32,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:13:32,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:13:32,525 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:13:32,525 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-18 20:13:32,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:32,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-18 20:13:32,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-18 20:13:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:13:32,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:33,129 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-18 20:13:33,130 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 21 treesize of output 20 [2022-11-18 20:13:33,306 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-11-18 20:13:33,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2022-11-18 20:13:33,400 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))) is different from false [2022-11-18 20:13:33,427 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse0)))) is different from false [2022-11-18 20:13:33,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:33,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-18 20:13:33,440 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 36 treesize of output 24 [2022-11-18 20:13:33,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:13:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 7 not checked. [2022-11-18 20:13:33,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942741668] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:33,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:33,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-11-18 20:13:33,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662944745] [2022-11-18 20:13:33,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:33,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-18 20:13:33,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:33,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-18 20:13:33,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1343, Unknown=38, NotChecked=308, Total=1806 [2022-11-18 20:13:33,719 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:35,460 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-11-18 20:13:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-18 20:13:35,461 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-18 20:13:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:35,462 INFO L225 Difference]: With dead ends: 136 [2022-11-18 20:13:35,462 INFO L226 Difference]: Without dead ends: 136 [2022-11-18 20:13:35,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=442, Invalid=2958, Unknown=38, NotChecked=468, Total=3906 [2022-11-18 20:13:35,464 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 414 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 547 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:35,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 831 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 806 Invalid, 0 Unknown, 547 Unchecked, 0.6s Time] [2022-11-18 20:13:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-18 20:13:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2022-11-18 20:13:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-11-18 20:13:35,468 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2022-11-18 20:13:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:35,468 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-11-18 20:13:35,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-11-18 20:13:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-18 20:13:35,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:35,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:35,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:35,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:13:35,670 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2022-11-18 20:13:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:35,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131985667] [2022-11-18 20:13:35,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:13:37,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:37,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131985667] [2022-11-18 20:13:37,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131985667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:37,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700567252] [2022-11-18 20:13:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:37,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:37,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:37,481 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:37,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:13:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:37,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-18 20:13:37,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:37,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:13:37,927 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:13:37,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:13:38,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:13:38,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:13:38,571 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:13:38,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-18 20:13:38,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-11-18 20:13:38,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:38,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-11-18 20:13:38,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:38,801 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 34 [2022-11-18 20:13:38,930 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 39 treesize of output 21 [2022-11-18 20:13:38,935 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 32 treesize of output 14 [2022-11-18 20:13:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:13:39,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:41,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:41,739 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 47 treesize of output 51 [2022-11-18 20:13:41,797 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1))) (forall ((v_ArrVal_1089 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2022-11-18 20:13:41,835 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1))) (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1089 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2022-11-18 20:13:41,866 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) 1))) (forall ((v_ArrVal_1089 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-11-18 20:13:41,903 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1089 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-11-18 20:13:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-18 20:13:42,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700567252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:42,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:42,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 51 [2022-11-18 20:13:42,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214397426] [2022-11-18 20:13:42,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:42,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-18 20:13:42,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-18 20:13:42,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2111, Unknown=4, NotChecked=380, Total=2652 [2022-11-18 20:13:42,669 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:48,498 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2022-11-18 20:13:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:13:48,499 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-18 20:13:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:48,500 INFO L225 Difference]: With dead ends: 149 [2022-11-18 20:13:48,500 INFO L226 Difference]: Without dead ends: 149 [2022-11-18 20:13:48,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=606, Invalid=4236, Unknown=4, NotChecked=556, Total=5402 [2022-11-18 20:13:48,503 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 846 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 575 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:48,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1591 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1126 Invalid, 0 Unknown, 575 Unchecked, 1.1s Time] [2022-11-18 20:13:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-18 20:13:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 90. [2022-11-18 20:13:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-11-18 20:13:48,508 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2022-11-18 20:13:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:48,508 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-11-18 20:13:48,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-11-18 20:13:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-18 20:13:48,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:48,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:48,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:48,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:48,717 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2022-11-18 20:13:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:48,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868565470] [2022-11-18 20:13:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:13:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:48,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868565470] [2022-11-18 20:13:48,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868565470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:48,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985164461] [2022-11-18 20:13:48,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:13:48,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:48,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:48,941 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:48,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:13:49,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:13:49,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:13:49,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:13:49,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-18 20:13:49,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:13:49,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985164461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:49,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:13:49,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-18 20:13:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59470237] [2022-11-18 20:13:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:49,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:13:49,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:49,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:13:49,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:13:49,272 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:49,337 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-18 20:13:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:13:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-18 20:13:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:49,338 INFO L225 Difference]: With dead ends: 76 [2022-11-18 20:13:49,338 INFO L226 Difference]: Without dead ends: 76 [2022-11-18 20:13:49,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:13:49,339 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 90 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:49,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 93 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:13:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-18 20:13:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-18 20:13:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.173913043478261) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-18 20:13:49,342 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 47 [2022-11-18 20:13:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:49,342 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-18 20:13:49,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-18 20:13:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:13:49,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:49,343 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:49,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:49,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:49,550 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:13:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2022-11-18 20:13:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:49,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926849616] [2022-11-18 20:13:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:49,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:52,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926849616] [2022-11-18 20:13:52,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926849616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:52,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900305983] [2022-11-18 20:13:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:52,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:52,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:52,481 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:52,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:13:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:52,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-18 20:13:52,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:52,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:13:53,076 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:13:53,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:13:53,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:13:53,321 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 6 treesize of output 5 [2022-11-18 20:13:54,084 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:13:54,084 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 66 treesize of output 63 [2022-11-18 20:13:54,095 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 33 treesize of output 23 [2022-11-18 20:13:54,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:54,102 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 36 treesize of output 38 [2022-11-18 20:13:54,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:13:54,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:54,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-11-18 20:13:54,424 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 30 treesize of output 32 [2022-11-18 20:13:54,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:54,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-11-18 20:13:54,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-18 20:13:54,809 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-18 20:13:54,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:13:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:13:55,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:55,662 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1312) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1310)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) 1) .cse3)) (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= .cse3 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1312) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1310)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) 1))))) is different from false [2022-11-18 20:13:56,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:56,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-11-18 20:13:56,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:56,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 101 [2022-11-18 20:13:56,313 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 37 treesize of output 23 [2022-11-18 20:13:56,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:56,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-11-18 20:13:56,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:56,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 101 [2022-11-18 20:13:56,429 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 37 treesize of output 23 [2022-11-18 20:13:56,520 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse2 .cse1))) is different from false [2022-11-18 20:13:56,623 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0))))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse2 .cse1))) is different from false [2022-11-18 20:13:56,683 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) (select (store (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-18 20:13:56,789 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0)))) is different from false [2022-11-18 20:13:56,836 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) |c_ULTIMATE.start_sll_create_#res#1.base|))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) .cse0)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-18 20:13:56,882 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-18 20:13:57,003 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-18 20:13:57,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:57,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-18 20:13:57,031 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 42 treesize of output 38 [2022-11-18 20:13:57,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:13:57,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-18 20:13:57,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:13:57,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:13:57,056 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:13:57,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-11-18 20:13:57,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:13:57,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:13:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-18 20:13:57,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900305983] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:57,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:57,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 73 [2022-11-18 20:13:57,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952203022] [2022-11-18 20:13:57,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:57,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-18 20:13:57,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:57,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-18 20:13:57,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3925, Unknown=29, NotChecked=1064, Total=5256 [2022-11-18 20:13:57,567 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:01,823 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-18 20:14:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-18 20:14:01,824 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-18 20:14:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:01,825 INFO L225 Difference]: With dead ends: 83 [2022-11-18 20:14:01,825 INFO L226 Difference]: Without dead ends: 83 [2022-11-18 20:14:01,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 98 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=648, Invalid=7724, Unknown=32, NotChecked=1496, Total=9900 [2022-11-18 20:14:01,828 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 271 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 516 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:01,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 983 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1285 Invalid, 0 Unknown, 516 Unchecked, 1.1s Time] [2022-11-18 20:14:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-18 20:14:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2022-11-18 20:14:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-18 20:14:01,832 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2022-11-18 20:14:01,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:01,833 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-18 20:14:01,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-18 20:14:01,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:14:01,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:01,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:01,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:02,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:02,039 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:14:02,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2022-11-18 20:14:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:02,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409478376] [2022-11-18 20:14:02,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:02,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:14:02,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:02,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409478376] [2022-11-18 20:14:02,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409478376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:02,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820833642] [2022-11-18 20:14:02,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:02,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:02,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:02,859 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:02,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:14:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:03,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-18 20:14:03,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:03,608 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 15 treesize of output 11 [2022-11-18 20:14:04,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:14:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:14:04,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:04,291 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 36 treesize of output 32 [2022-11-18 20:14:04,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:04,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-18 20:14:04,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820833642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:14:04,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:14:04,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 12] total 34 [2022-11-18 20:14:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035453699] [2022-11-18 20:14:04,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:04,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-18 20:14:04,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:04,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-18 20:14:04,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 20:14:04,531 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:06,334 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-11-18 20:14:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:14:06,338 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-18 20:14:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:06,339 INFO L225 Difference]: With dead ends: 99 [2022-11-18 20:14:06,339 INFO L226 Difference]: Without dead ends: 99 [2022-11-18 20:14:06,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=463, Invalid=2189, Unknown=0, NotChecked=0, Total=2652 [2022-11-18 20:14:06,341 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 826 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:06,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 523 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:14:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-18 20:14:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-11-18 20:14:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-18 20:14:06,345 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 55 [2022-11-18 20:14:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:06,345 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-18 20:14:06,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-18 20:14:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:14:06,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:06,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:06,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:06,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:06,547 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:14:06,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:06,548 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2022-11-18 20:14:06,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:06,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912603643] [2022-11-18 20:14:06,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:06,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-18 20:14:06,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:06,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912603643] [2022-11-18 20:14:06,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912603643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:06,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793970348] [2022-11-18 20:14:06,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:14:06,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:06,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:06,844 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:06,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 20:14:07,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:14:07,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:14:07,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:14:07,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-18 20:14:07,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-18 20:14:07,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793970348] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:14:07,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:14:07,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-18 20:14:07,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868636517] [2022-11-18 20:14:07,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:07,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:14:07,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:07,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:14:07,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:14:07,302 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:07,392 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-11-18 20:14:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:14:07,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-18 20:14:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:07,393 INFO L225 Difference]: With dead ends: 71 [2022-11-18 20:14:07,393 INFO L226 Difference]: Without dead ends: 71 [2022-11-18 20:14:07,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:14:07,394 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 99 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:07,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 137 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:14:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-18 20:14:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-18 20:14:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-11-18 20:14:07,397 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2022-11-18 20:14:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:07,398 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-11-18 20:14:07,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-11-18 20:14:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:14:07,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:07,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:07,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:07,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-18 20:14:07,606 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:14:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2022-11-18 20:14:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:07,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818897805] [2022-11-18 20:14:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-18 20:14:07,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:07,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818897805] [2022-11-18 20:14:07,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818897805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:14:07,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:14:07,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:14:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276997547] [2022-11-18 20:14:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:14:07,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:14:07,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:07,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:14:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:14:07,822 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:08,126 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-11-18 20:14:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:14:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-18 20:14:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:08,127 INFO L225 Difference]: With dead ends: 82 [2022-11-18 20:14:08,127 INFO L226 Difference]: Without dead ends: 82 [2022-11-18 20:14:08,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:14:08,128 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 226 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:08,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 89 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:14:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-18 20:14:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-11-18 20:14:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-18 20:14:08,131 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 59 [2022-11-18 20:14:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:08,131 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-18 20:14:08,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-18 20:14:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:14:08,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:08,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:08,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 20:14:08,133 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:14:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2022-11-18 20:14:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:08,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097881118] [2022-11-18 20:14:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-18 20:14:08,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:08,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097881118] [2022-11-18 20:14:08,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097881118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:14:08,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:14:08,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:14:08,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571902302] [2022-11-18 20:14:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:14:08,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:14:08,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:08,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:14:08,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:14:08,535 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:08,909 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-18 20:14:08,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:14:08,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-18 20:14:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:08,911 INFO L225 Difference]: With dead ends: 80 [2022-11-18 20:14:08,911 INFO L226 Difference]: Without dead ends: 80 [2022-11-18 20:14:08,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:14:08,912 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 290 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:08,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 52 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:14:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-18 20:14:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-18 20:14:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-11-18 20:14:08,914 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2022-11-18 20:14:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:08,915 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-18 20:14:08,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-11-18 20:14:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-18 20:14:08,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:08,915 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:08,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 20:14:08,916 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:14:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2022-11-18 20:14:08,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:08,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727839488] [2022-11-18 20:14:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-18 20:14:09,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:09,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727839488] [2022-11-18 20:14:09,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727839488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:14:09,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:14:09,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:14:09,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628418138] [2022-11-18 20:14:09,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:14:09,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:14:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:09,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:14:09,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:14:09,100 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:09,336 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-11-18 20:14:09,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:14:09,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-11-18 20:14:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:09,338 INFO L225 Difference]: With dead ends: 77 [2022-11-18 20:14:09,338 INFO L226 Difference]: Without dead ends: 77 [2022-11-18 20:14:09,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:14:09,339 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 272 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:09,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 81 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:14:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-18 20:14:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-11-18 20:14:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-11-18 20:14:09,341 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2022-11-18 20:14:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:09,342 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-11-18 20:14:09,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-11-18 20:14:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-18 20:14:09,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:09,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:09,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 20:14:09,343 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:14:09,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2022-11-18 20:14:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:09,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355269524] [2022-11-18 20:14:09,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:09,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-18 20:14:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:09,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355269524] [2022-11-18 20:14:09,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355269524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:14:09,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:14:09,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:14:09,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424712655] [2022-11-18 20:14:09,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:14:09,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:14:09,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:14:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:14:09,586 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:09,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:09,859 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-11-18 20:14:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:14:09,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-18 20:14:09,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:09,860 INFO L225 Difference]: With dead ends: 75 [2022-11-18 20:14:09,860 INFO L226 Difference]: Without dead ends: 75 [2022-11-18 20:14:09,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:14:09,861 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 255 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:09,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 65 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:14:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-18 20:14:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-18 20:14:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-11-18 20:14:09,864 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2022-11-18 20:14:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:09,864 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-11-18 20:14:09,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-11-18 20:14:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-18 20:14:09,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:09,865 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:09,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-18 20:14:09,867 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:14:09,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2022-11-18 20:14:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:09,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887315479] [2022-11-18 20:14:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-18 20:14:11,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:11,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887315479] [2022-11-18 20:14:11,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887315479] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:11,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699639016] [2022-11-18 20:14:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:11,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:11,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:11,591 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:11,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 20:14:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:11,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-18 20:14:11,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:11,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:14:11,947 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:14:11,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 20:14:12,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:14:12,259 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:14:12,259 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 23 treesize of output 26 [2022-11-18 20:14:12,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:12,375 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 23 [2022-11-18 20:14:12,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:12,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2022-11-18 20:14:12,762 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:14:12,762 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-18 20:14:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:14:12,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:13,322 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= 1 (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4))))) is different from false [2022-11-18 20:14:13,352 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-18 20:14:13,372 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-18 20:14:14,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:14,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-18 20:14:14,201 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 48 treesize of output 44 [2022-11-18 20:14:14,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:14,218 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 44 [2022-11-18 20:14:14,228 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 32 treesize of output 30 [2022-11-18 20:14:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 4 not checked. [2022-11-18 20:14:14,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699639016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:14:14,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:14:14,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 45 [2022-11-18 20:14:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799317875] [2022-11-18 20:14:14,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:14,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-18 20:14:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-18 20:14:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1606, Unknown=53, NotChecked=252, Total=2070 [2022-11-18 20:14:14,850 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:16,767 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-11-18 20:14:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:14:16,768 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-18 20:14:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:16,769 INFO L225 Difference]: With dead ends: 84 [2022-11-18 20:14:16,769 INFO L226 Difference]: Without dead ends: 84 [2022-11-18 20:14:16,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 103 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=419, Invalid=2961, Unknown=54, NotChecked=348, Total=3782 [2022-11-18 20:14:16,771 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 173 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 503 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:16,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 509 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 530 Invalid, 0 Unknown, 503 Unchecked, 0.5s Time] [2022-11-18 20:14:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-18 20:14:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-11-18 20:14:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-11-18 20:14:16,777 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2022-11-18 20:14:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:16,777 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-11-18 20:14:16,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-11-18 20:14:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-18 20:14:16,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:16,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:16,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:16,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-18 20:14:16,986 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:14:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2022-11-18 20:14:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:16,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612597575] [2022-11-18 20:14:16,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:16,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:14:19,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:19,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612597575] [2022-11-18 20:14:19,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612597575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:19,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141254691] [2022-11-18 20:14:19,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:19,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:19,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:19,400 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:19,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 20:14:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:19,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-18 20:14:19,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:19,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:14:19,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:14:19,937 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:14:19,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-18 20:14:19,961 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:14:19,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:14:20,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:14:20,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:14:20,771 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:14:20,772 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 42 treesize of output 41 [2022-11-18 20:14:20,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:20,782 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 22 [2022-11-18 20:14:20,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:20,940 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 19 treesize of output 18 [2022-11-18 20:14:20,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:20,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-18 20:14:21,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:21,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2022-11-18 20:14:21,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:21,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-18 20:14:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:14:21,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:29,703 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (< (select .cse0 .cse1) 0) (forall ((v_ArrVal_1962 Int)) (<= (+ (select .cse0 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4))))))))) (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (< (select .cse2 .cse1) 0) (<= 0 (+ (select .cse2 4) 4))))))))) is different from false [2022-11-18 20:14:38,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:38,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 102 [2022-11-18 20:14:38,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:38,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 92 [2022-11-18 20:14:38,458 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 120 treesize of output 116 [2022-11-18 20:14:38,468 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 214 treesize of output 202 [2022-11-18 20:14:38,476 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 231 treesize of output 227 [2022-11-18 20:14:38,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:38,499 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 288 treesize of output 287 [2022-11-18 20:14:38,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:38,527 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 334 treesize of output 332 [2022-11-18 20:14:38,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:38,567 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 424 treesize of output 410 [2022-11-18 20:14:38,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:38,595 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 423 treesize of output 426 [2022-11-18 20:14:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-11-18 20:14:46,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141254691] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:14:46,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:14:46,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 27] total 71 [2022-11-18 20:14:46,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192161200] [2022-11-18 20:14:46,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:46,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-18 20:14:46,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:46,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-18 20:14:46,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=4643, Unknown=41, NotChecked=138, Total=5112 [2022-11-18 20:14:46,145 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:55,572 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-11-18 20:14:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:14:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-18 20:14:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:55,573 INFO L225 Difference]: With dead ends: 85 [2022-11-18 20:14:55,574 INFO L226 Difference]: Without dead ends: 85 [2022-11-18 20:14:55,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=897, Invalid=7996, Unknown=41, NotChecked=186, Total=9120 [2022-11-18 20:14:55,578 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 612 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 515 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:55,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 718 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1007 Invalid, 0 Unknown, 515 Unchecked, 1.0s Time] [2022-11-18 20:14:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-18 20:14:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-11-18 20:14:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-18 20:14:55,582 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2022-11-18 20:14:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:55,582 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-18 20:14:55,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-18 20:14:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 20:14:55,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:55,583 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:55,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:55,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-18 20:14:55,791 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:14:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366217, now seen corresponding path program 1 times [2022-11-18 20:14:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:55,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494393815] [2022-11-18 20:14:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:14:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:57,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494393815] [2022-11-18 20:14:57,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494393815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:57,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050934763] [2022-11-18 20:14:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:57,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:57,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:57,736 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:57,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-18 20:14:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:58,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-18 20:14:58,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:58,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:14:59,753 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:14:59,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2022-11-18 20:14:59,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:14:59,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-11-18 20:15:00,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:00,227 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 72 treesize of output 59 [2022-11-18 20:15:01,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:01,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 56 [2022-11-18 20:15:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:15:02,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:15:05,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:05,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-18 20:15:05,330 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 41 treesize of output 37 [2022-11-18 20:15:05,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:05,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 48 treesize of output 50 [2022-11-18 20:15:05,354 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 48 treesize of output 46 [2022-11-18 20:15:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-18 20:15:06,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050934763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:15:06,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:15:06,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-11-18 20:15:06,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824055893] [2022-11-18 20:15:06,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:15:06,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-18 20:15:06,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:06,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-18 20:15:06,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4825, Unknown=5, NotChecked=0, Total=5112 [2022-11-18 20:15:06,730 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:15:10,638 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-11-18 20:15:10,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-18 20:15:10,639 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-18 20:15:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:15:10,640 INFO L225 Difference]: With dead ends: 132 [2022-11-18 20:15:10,640 INFO L226 Difference]: Without dead ends: 132 [2022-11-18 20:15:10,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=539, Invalid=9962, Unknown=5, NotChecked=0, Total=10506 [2022-11-18 20:15:10,643 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 55 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:15:10,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1058 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 138 Unchecked, 0.1s Time] [2022-11-18 20:15:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-18 20:15:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2022-11-18 20:15:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-11-18 20:15:10,650 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2022-11-18 20:15:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:15:10,650 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-11-18 20:15:10,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-11-18 20:15:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 20:15:10,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:15:10,652 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:10,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:15:10,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:15:10,863 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:15:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:10,864 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2022-11-18 20:15:10,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:10,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245041283] [2022-11-18 20:15:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:10,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:15:12,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:12,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245041283] [2022-11-18 20:15:12,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245041283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:15:12,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664648139] [2022-11-18 20:15:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:12,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:15:12,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:15:12,652 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:15:12,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-18 20:15:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:12,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-18 20:15:12,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:15:12,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:15:13,118 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:15:13,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 11 treesize of output 11 [2022-11-18 20:15:13,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:15:13,448 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:15:13,448 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-18 20:15:13,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:13,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-18 20:15:13,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:13,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-18 20:15:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:15:13,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:15:16,937 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-18 20:15:16,958 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-18 20:15:16,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-18 20:15:17,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:17,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-18 20:15:17,379 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 38 treesize of output 34 [2022-11-18 20:15:17,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:17,395 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 32 treesize of output 34 [2022-11-18 20:15:17,403 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 22 treesize of output 20 [2022-11-18 20:15:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 4 not checked. [2022-11-18 20:15:17,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664648139] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:15:17,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:15:17,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 46 [2022-11-18 20:15:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076725130] [2022-11-18 20:15:17,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:15:17,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-18 20:15:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-18 20:15:17,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1701, Unknown=49, NotChecked=258, Total=2162 [2022-11-18 20:15:17,941 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:15:20,667 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2022-11-18 20:15:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 20:15:20,668 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-18 20:15:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:15:20,669 INFO L225 Difference]: With dead ends: 88 [2022-11-18 20:15:20,669 INFO L226 Difference]: Without dead ends: 88 [2022-11-18 20:15:20,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 107 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=491, Invalid=3762, Unknown=49, NotChecked=390, Total=4692 [2022-11-18 20:15:20,671 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 238 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 548 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:15:20,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 679 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 777 Invalid, 0 Unknown, 548 Unchecked, 0.8s Time] [2022-11-18 20:15:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-18 20:15:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2022-11-18 20:15:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-11-18 20:15:20,674 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2022-11-18 20:15:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:15:20,675 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-11-18 20:15:20,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-11-18 20:15:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-18 20:15:20,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:15:20,676 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:20,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-18 20:15:20,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:15:20,884 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:15:20,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2022-11-18 20:15:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:20,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863365700] [2022-11-18 20:15:20,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 20:15:24,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:24,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863365700] [2022-11-18 20:15:24,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863365700] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:15:24,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883890278] [2022-11-18 20:15:24,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:15:24,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:15:24,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:15:24,953 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:15:24,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-18 20:15:25,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:15:25,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:15:25,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-18 20:15:25,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:15:25,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:15:25,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:15:25,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:15:25,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:25,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:15:25,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:25,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:15:25,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:15:25,539 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 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-18 20:15:25,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:15:25,550 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 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-18 20:15:25,634 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:15:25,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:15:25,670 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-18 20:15:25,678 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-18 20:15:25,704 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-18 20:15:25,715 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-18 20:15:25,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:15:25,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-18 20:15:26,691 INFO L321 Elim1Store]: treesize reduction 98, result has 41.0 percent of original size [2022-11-18 20:15:26,691 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 6 case distinctions, treesize of input 89 treesize of output 118 [2022-11-18 20:15:26,785 INFO L321 Elim1Store]: treesize reduction 52, result has 52.7 percent of original size [2022-11-18 20:15:26,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 123 [2022-11-18 20:15:27,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:27,812 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-11-18 20:15:27,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 121 [2022-11-18 20:15:27,880 INFO L321 Elim1Store]: treesize reduction 40, result has 54.0 percent of original size [2022-11-18 20:15:27,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 158 [2022-11-18 20:15:28,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:15:28,064 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:15:28,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2022-11-18 20:15:28,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:15:30,893 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-18 20:15:30,893 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 57 treesize of output 38 [2022-11-18 20:15:30,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:30,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2022-11-18 20:15:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-18 20:15:30,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:15:43,408 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-18 20:15:43,408 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 246 treesize of output 193 [2022-11-18 20:15:43,417 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 286 treesize of output 274 [2022-11-18 20:15:43,795 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-18 20:15:43,796 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 189 [2022-11-18 20:15:43,933 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-18 20:15:43,933 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 254 treesize of output 217 [2022-11-18 20:15:47,923 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse9 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse48 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse86 (select v_arrayElimArr_13 4)) (.cse87 (select v_arrayElimArr_12 4))) (select (store (let ((.cse85 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse85 .cse86 (store (select .cse85 .cse86) .cse87 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse88 .cse86 (store (select .cse88 .cse86) .cse87 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (.cse32 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (select (store (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (.cse4 (not .cse9))) (and (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse2 (select v_arrayElimArr_12 4))) (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse4) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))) (= (select (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse8 (select v_arrayElimArr_11 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse6 0 v_ArrVal_2326)) (select .cse6 4)))) 4) 0))) .cse9) (or .cse4 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (or (= (select (let ((.cse10 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse11 0 v_ArrVal_2326)) (select .cse11 4)))) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0)))))) (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (or (= (select (let ((.cse13 (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base|) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse14 0 v_ArrVal_2326)) (select .cse14 4)))) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))) (= (select (let ((.cse16 (let ((.cse18 (select v_arrayElimArr_11 4))) (store .cse15 .cse18 (store (select .cse15 .cse18) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse17 0 v_ArrVal_2326)) (select .cse17 4)))) 4) 0))))) (or .cse4 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_arrayElimCell_135 Int) (v_ArrVal_2326 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (or (= (select (let ((.cse19 (store .cse21 v_arrayElimCell_135 (store (select .cse21 v_arrayElimCell_135) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse19 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse20 0 v_ArrVal_2326)) (select .cse20 4)))) 4) 0) (= (select (let ((.cse22 (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse23 0 v_ArrVal_2326)) (select .cse23 4)))) 4) 0)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (= (select (let ((.cse24 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse25 0 v_ArrVal_2326)) (select .cse25 4)))) 4) 0)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))))))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) .cse4) (or .cse4 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (let ((.cse30 (select v_arrayElimArr_12 4))) (select (store (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse30 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse30 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) .cse32 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse34 (select v_arrayElimArr_12 4))) (or (= (select (select (store (store .cse33 v_arrayElimCell_138 (store (select .cse33 v_arrayElimCell_138) .cse34 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse35 v_arrayElimCell_138 (store (select .cse35 v_arrayElimCell_138) .cse34 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse34 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse34 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse40 (select v_arrayElimArr_13 4))) (let ((.cse41 (select .cse36 .cse40)) (.cse42 (select .cse38 .cse40)) (.cse37 (select .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse39 (select .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse43 (select v_arrayElimArr_12 4))) (or (= (select (select (store (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse37 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse36 .cse40 (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 .cse40 (store .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse36 .cse40 (store .cse41 .cse43 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 .cse40 (store .cse42 .cse43 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse37 .cse43 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse39 .cse43 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse46 (select v_arrayElimArr_12 4))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse45 (select v_arrayElimArr_13 4))) (select (store (store .cse44 .cse45 (store (select .cse44 .cse45) .cse46 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse47 .cse45 (store (select .cse47 .cse45) .cse46 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select (store (store .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse46 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse46 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse9) (or .cse48 .cse9) (or .cse4 .cse48) (or .cse9 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse50 (select v_arrayElimArr_13 4))) (let ((.cse51 (select .cse49 .cse50)) (.cse53 (select .cse52 .cse50)) (.cse54 (select v_arrayElimArr_12 4))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (select (store (store .cse49 .cse50 (store .cse51 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse52 .cse50 (store .cse53 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse49 .cse50 (store .cse51 .cse54 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse52 .cse50 (store .cse53 .cse54 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse54 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse54 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))))) (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse60 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse58 (select v_arrayElimArr_13 4))) (let ((.cse59 (select .cse57 .cse58)) (.cse61 (select .cse60 .cse58))) (or (= (select (select (store (store .cse57 .cse58 (store .cse59 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse60 .cse58 (store .cse61 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse57 .cse58 (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse60 .cse58 (store .cse61 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse66 (select .cse62 v_arrayElimCell_138)) (.cse67 (select .cse64 v_arrayElimCell_138)) (.cse63 (select .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse65 (select .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse63 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse65 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse62 v_arrayElimCell_138 (store .cse66 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 v_arrayElimCell_138 (store .cse67 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse62 v_arrayElimCell_138 (store .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 v_arrayElimCell_138 (store .cse67 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse63 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse65 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) .cse32 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse69 (select .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse71 (select .cse70 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse70 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse71 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse69 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse70 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse71 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse72 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse75 (select .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse72 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse73 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse72 v_arrayElimCell_138 (store (select .cse72 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse74 v_arrayElimCell_138 (store (select .cse74 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse72 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse73 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse75 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse76 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse77 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (select (store (store .cse76 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse76 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse78 (select v_arrayElimArr_13 4))) (select (store (store .cse76 .cse78 (store (select .cse76 .cse78) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse77 .cse78 (store (select .cse77 .cse78) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse81 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse79 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse82 (select .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse80 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse82 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store (store .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse80 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse82 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))))))) .cse4)))) (not (<= 0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) is different from true [2022-11-18 20:17:08,762 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (= (select (let ((.cse0 (let ((.cse2 (store .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_11))) (store .cse2 |c_ULTIMATE.start_node_create_#res#1.base| (store (select .cse2 |c_ULTIMATE.start_node_create_#res#1.base|) |c_ULTIMATE.start_node_create_#res#1.offset| v_ArrVal_2322))))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse1 0 v_ArrVal_2326)) (select .cse1 4)))) 4) 0)) (not (= |c_ULTIMATE.start_node_create_#res#1.base| (select v_arrayElimArr_11 4))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_12 4))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12)) (.cse6 (store .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13))) (or (= (select (select (store (store .cse4 v_arrayElimCell_138 (store (select .cse4 v_arrayElimCell_138) .cse5 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse6 v_arrayElimCell_138 (store (select .cse6 v_arrayElimCell_138) .cse5 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse4 |c_ULTIMATE.start_node_create_#res#1.base| (store (select .cse4 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| (store (select .cse6 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0)))) (not (= |c_ULTIMATE.start_node_create_#res#1.base| (select v_arrayElimArr_13 4))))) (not (= .cse5 |c_ULTIMATE.start_node_create_#res#1.offset|)))))))))) is different from false [2022-11-18 20:17:08,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select v_arrayElimArr_11 4))) (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (= (select (let ((.cse0 (let ((.cse2 (store .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_11))) (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2322))))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse1 0 v_ArrVal_2326)) (select .cse1 4)))) 4) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_12 4))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12)) (.cse6 (store .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13))) (or (= (select (select (store (store .cse4 v_arrayElimCell_138 (store (select .cse4 v_arrayElimCell_138) .cse5 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse6 v_arrayElimCell_138 (store (select .cse6 v_arrayElimCell_138) .cse5 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse5 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse5 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0)))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select v_arrayElimArr_13 4))))) (not (= .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))))))))) is different from false [2022-11-18 20:17:14,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:17:14,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:14,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 237 treesize of output 183 [2022-11-18 20:17:14,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:17:14,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:14,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 111 [2022-11-18 20:17:14,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:14,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 11221 treesize of output 10795 [2022-11-18 20:17:15,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:15,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26250 treesize of output 25480 [2022-11-18 20:17:15,492 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 25538 treesize of output 23790 [2022-11-18 20:17:16,101 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 27724 treesize of output 25430 [2022-11-18 20:17:16,953 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 17031 treesize of output 16839 [2022-11-18 20:17:17,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:17,196 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 254 treesize of output 254 [2022-11-18 20:17:19,240 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 548 treesize of output 540 [2022-11-18 20:17:19,407 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-18 20:17:19,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:17:19,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:17:19,565 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 33 treesize of output 27 [2022-11-18 20:17:19,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:17:19,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-18 20:17:20,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:20,012 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 14577 treesize of output 14199 [2022-11-18 20:17:20,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:20,840 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 9682 treesize of output 9648 [2022-11-18 20:18:41,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:18:41,623 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 4906 treesize of output 4876 [2022-11-18 20:19:25,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:19:25,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 80 [2022-11-18 20:19:25,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:19:25,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:19:25,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:19:25,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-18 20:19:25,391 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 6 treesize of output 4 [2022-11-18 20:19:25,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:19:25,404 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 26 treesize of output 28 [2022-11-18 20:19:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 5 not checked. [2022-11-18 20:19:25,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883890278] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:19:25,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:19:25,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 33] total 73 [2022-11-18 20:19:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98818039] [2022-11-18 20:19:25,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:19:25,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-18 20:19:25,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:19:25,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-18 20:19:25,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=4516, Unknown=35, NotChecked=414, Total=5256 [2022-11-18 20:19:25,862 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 73 states, 73 states have (on average 2.26027397260274) internal successors, (165), 73 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:19:29,322 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or (let ((.cse0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse48 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse86 (select v_arrayElimArr_13 4)) (.cse87 (select v_arrayElimArr_12 4))) (select (store (let ((.cse85 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse85 .cse86 (store (select .cse85 .cse86) .cse87 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse88 .cse86 (store (select .cse88 .cse86) .cse87 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (.cse32 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (select (store (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (.cse4 (not .cse9))) (and (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse2 (select v_arrayElimArr_12 4))) (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse4) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))) (= (select (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse8 (select v_arrayElimArr_11 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse6 0 v_ArrVal_2326)) (select .cse6 4)))) 4) 0))) .cse9) (or .cse4 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (or (= (select (let ((.cse10 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse11 0 v_ArrVal_2326)) (select .cse11 4)))) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0)))))) (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (or (= (select (let ((.cse13 (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base|) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse14 0 v_ArrVal_2326)) (select .cse14 4)))) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))) (= (select (let ((.cse16 (let ((.cse18 (select v_arrayElimArr_11 4))) (store .cse15 .cse18 (store (select .cse15 .cse18) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse17 0 v_ArrVal_2326)) (select .cse17 4)))) 4) 0))))) (or .cse4 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_arrayElimCell_135 Int) (v_ArrVal_2326 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (or (= (select (let ((.cse19 (store .cse21 v_arrayElimCell_135 (store (select .cse21 v_arrayElimCell_135) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse19 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse20 0 v_ArrVal_2326)) (select .cse20 4)))) 4) 0) (= (select (let ((.cse22 (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse23 0 v_ArrVal_2326)) (select .cse23 4)))) 4) 0)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (= (select (let ((.cse24 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse25 0 v_ArrVal_2326)) (select .cse25 4)))) 4) 0)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))))))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) .cse4) (or .cse4 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (let ((.cse30 (select v_arrayElimArr_12 4))) (select (store (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse30 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse30 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) .cse32 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse34 (select v_arrayElimArr_12 4))) (or (= (select (select (store (store .cse33 v_arrayElimCell_138 (store (select .cse33 v_arrayElimCell_138) .cse34 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse35 v_arrayElimCell_138 (store (select .cse35 v_arrayElimCell_138) .cse34 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse34 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse34 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse40 (select v_arrayElimArr_13 4))) (let ((.cse41 (select .cse36 .cse40)) (.cse42 (select .cse38 .cse40)) (.cse37 (select .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse39 (select .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse43 (select v_arrayElimArr_12 4))) (or (= (select (select (store (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse37 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse36 .cse40 (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 .cse40 (store .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse36 .cse40 (store .cse41 .cse43 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 .cse40 (store .cse42 .cse43 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse37 .cse43 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse39 .cse43 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse46 (select v_arrayElimArr_12 4))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse45 (select v_arrayElimArr_13 4))) (select (store (store .cse44 .cse45 (store (select .cse44 .cse45) .cse46 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse47 .cse45 (store (select .cse47 .cse45) .cse46 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select (store (store .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse46 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse46 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse9) (or .cse48 .cse9) (or .cse4 .cse48) (or .cse9 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse50 (select v_arrayElimArr_13 4))) (let ((.cse51 (select .cse49 .cse50)) (.cse53 (select .cse52 .cse50)) (.cse54 (select v_arrayElimArr_12 4))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (select (store (store .cse49 .cse50 (store .cse51 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse52 .cse50 (store .cse53 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse49 .cse50 (store .cse51 .cse54 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse52 .cse50 (store .cse53 .cse54 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse54 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse54 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))))) (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse60 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse58 (select v_arrayElimArr_13 4))) (let ((.cse59 (select .cse57 .cse58)) (.cse61 (select .cse60 .cse58))) (or (= (select (select (store (store .cse57 .cse58 (store .cse59 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse60 .cse58 (store .cse61 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse57 .cse58 (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse60 .cse58 (store .cse61 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse66 (select .cse62 v_arrayElimCell_138)) (.cse67 (select .cse64 v_arrayElimCell_138)) (.cse63 (select .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse65 (select .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse63 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse65 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse62 v_arrayElimCell_138 (store .cse66 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 v_arrayElimCell_138 (store .cse67 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse62 v_arrayElimCell_138 (store .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 v_arrayElimCell_138 (store .cse67 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse63 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse65 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) .cse32 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse69 (select .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse71 (select .cse70 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse70 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse71 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse69 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse70 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse71 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse72 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse75 (select .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse72 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse73 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse72 v_arrayElimCell_138 (store (select .cse72 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse74 v_arrayElimCell_138 (store (select .cse74 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse72 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse73 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse75 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse76 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse77 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (select (store (store .cse76 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse76 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse78 (select v_arrayElimArr_13 4))) (select (store (store .cse76 .cse78 (store (select .cse76 .cse78) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse77 .cse78 (store (select .cse77 .cse78) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse81 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse79 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse82 (select .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse80 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse82 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store (store .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse80 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse82 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))))))) .cse4)))) (not (<= 0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse9 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) is different from true [2022-11-18 20:19:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:34,281 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-11-18 20:19:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-18 20:19:34,283 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.26027397260274) internal successors, (165), 73 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-11-18 20:19:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:34,284 INFO L225 Difference]: With dead ends: 144 [2022-11-18 20:19:34,284 INFO L226 Difference]: Without dead ends: 144 [2022-11-18 20:19:34,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1843 ImplicationChecksByTransitivity, 108.8s TimeCoverageRelationStatistics Valid=590, Invalid=6872, Unknown=36, NotChecked=692, Total=8190 [2022-11-18 20:19:34,287 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 310 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 759 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:34,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1335 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 619 Invalid, 0 Unknown, 759 Unchecked, 1.1s Time] [2022-11-18 20:19:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-18 20:19:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 139. [2022-11-18 20:19:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 138 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:19:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2022-11-18 20:19:34,292 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 71 [2022-11-18 20:19:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:34,292 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2022-11-18 20:19:34,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.26027397260274) internal successors, (165), 73 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:19:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-11-18 20:19:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-18 20:19:34,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:34,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:34,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-18 20:19:34,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-18 20:19:34,502 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:19:34,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash 261816644, now seen corresponding path program 2 times [2022-11-18 20:19:34,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:19:34,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906523559] [2022-11-18 20:19:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:19:34,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:19:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:19:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:19:36,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:19:36,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906523559] [2022-11-18 20:19:36,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906523559] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:19:36,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907582392] [2022-11-18 20:19:36,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:19:36,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:19:36,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:19:36,769 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:19:36,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-18 20:19:37,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:19:37,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:19:37,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-18 20:19:37,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:37,315 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-18 20:19:37,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-11-18 20:19:37,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:19:39,161 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:19:39,161 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 60 treesize of output 59 [2022-11-18 20:19:39,202 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:19:39,202 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 45 treesize of output 35 [2022-11-18 20:19:39,950 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 20:19:39,950 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 93 treesize of output 80 [2022-11-18 20:19:41,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:19:41,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 73 [2022-11-18 20:19:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:19:43,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:19:46,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:19:46,014 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 2 case distinctions, treesize of input 39 treesize of output 39 [2022-11-18 20:19:46,071 INFO L321 Elim1Store]: treesize reduction 12, result has 66.7 percent of original size [2022-11-18 20:19:46,074 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 2 case distinctions, treesize of input 63 treesize of output 73 [2022-11-18 20:19:46,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:19:46,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 107 [2022-11-18 20:19:46,104 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 86 treesize of output 82 [2022-11-18 20:21:01,009 WARN L233 SmtUtils]: Spent 1.24m on a formula simplification. DAG size of input: 52 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:21:29,337 WARN L233 SmtUtils]: Spent 28.08s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:21:57,652 WARN L233 SmtUtils]: Spent 28.08s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:22:06,273 WARN L233 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:22:16,617 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:22:29,272 WARN L233 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:22:43,722 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:22:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:22:44,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907582392] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:22:44,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:22:44,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 62 [2022-11-18 20:22:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235613594] [2022-11-18 20:22:44,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:22:44,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-18 20:22:44,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:22:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-18 20:22:44,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3685, Unknown=10, NotChecked=0, Total=3906 [2022-11-18 20:22:44,056 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand has 63 states, 62 states have (on average 2.7580645161290325) internal successors, (171), 63 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:49,797 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-11-18 20:22:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-18 20:22:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.7580645161290325) internal successors, (171), 63 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-18 20:22:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:49,798 INFO L225 Difference]: With dead ends: 141 [2022-11-18 20:22:49,798 INFO L226 Difference]: Without dead ends: 90 [2022-11-18 20:22:49,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 188.7s TimeCoverageRelationStatistics Valid=468, Invalid=6328, Unknown=10, NotChecked=0, Total=6806 [2022-11-18 20:22:49,800 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 191 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 590 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:49,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 723 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 328 Invalid, 0 Unknown, 590 Unchecked, 0.7s Time] [2022-11-18 20:22:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-18 20:22:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-18 20:22:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 89 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-11-18 20:22:49,804 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 72 [2022-11-18 20:22:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:49,804 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-11-18 20:22:49,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.7580645161290325) internal successors, (171), 63 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-11-18 20:22:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-18 20:22:49,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:49,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:49,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:50,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:22:50,014 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-18 20:22:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 683637232, now seen corresponding path program 3 times [2022-11-18 20:22:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:22:50,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042177954] [2022-11-18 20:22:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:50,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:22:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-18 20:22:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:22:50,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042177954] [2022-11-18 20:22:50,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042177954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:22:50,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265715287] [2022-11-18 20:22:50,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:22:50,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:22:50,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:22:50,163 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:22:50,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-18 20:22:50,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-18 20:22:50,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:22:50,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:22:50,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-18 20:22:51,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:51,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265715287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:51,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:22:51,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-18 20:22:51,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499794232] [2022-11-18 20:22:51,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:51,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:22:51,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:22:51,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:22:51,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:22:51,015 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:51,036 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-11-18 20:22:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:22:51,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-11-18 20:22:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:51,037 INFO L225 Difference]: With dead ends: 21 [2022-11-18 20:22:51,037 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:22:51,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:22:51,038 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:51,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:22:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:22:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:22:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:22:51,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2022-11-18 20:22:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:51,039 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:22:51,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:22:51,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:22:51,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2022-11-18 20:22:51,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-11-18 20:22:51,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-11-18 20:22:51,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-11-18 20:22:51,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-11-18 20:22:51,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2022-11-18 20:22:51,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-11-18 20:22:51,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-11-18 20:22:51,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-11-18 20:22:51,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-11-18 20:22:51,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-11-18 20:22:51,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-11-18 20:22:51,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-11-18 20:22:51,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-11-18 20:22:51,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2022-11-18 20:22:51,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2022-11-18 20:22:51,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-11-18 20:22:51,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-11-18 20:22:51,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-11-18 20:22:51,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2022-11-18 20:22:51,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2022-11-18 20:22:51,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:51,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:22:51,261 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:51,264 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:22:51,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:22:51 BoogieIcfgContainer [2022-11-18 20:22:51,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:22:51,269 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:22:51,269 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:22:51,269 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:22:51,270 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:13:06" (3/4) ... [2022-11-18 20:22:51,274 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:22:51,291 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-18 20:22:51,291 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-18 20:22:51,292 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-18 20:22:51,292 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:22:51,348 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:22:51,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:22:51,348 INFO L158 Benchmark]: Toolchain (without parser) took 585822.02ms. Allocated memory was 104.9MB in the beginning and 612.4MB in the end (delta: 507.5MB). Free memory was 69.6MB in the beginning and 326.9MB in the end (delta: -257.3MB). Peak memory consumption was 248.4MB. Max. memory is 16.1GB. [2022-11-18 20:22:51,349 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 104.9MB. Free memory was 74.2MB in the beginning and 74.2MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:22:51,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.12ms. Allocated memory is still 104.9MB. Free memory was 69.6MB in the beginning and 73.2MB in the end (delta: -3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:22:51,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.51ms. Allocated memory is still 104.9MB. Free memory was 73.2MB in the beginning and 71.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:22:51,349 INFO L158 Benchmark]: Boogie Preprocessor took 61.03ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 69.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:22:51,350 INFO L158 Benchmark]: RCFGBuilder took 706.34ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 52.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 20:22:51,350 INFO L158 Benchmark]: TraceAbstraction took 584271.74ms. Allocated memory was 104.9MB in the beginning and 612.4MB in the end (delta: 507.5MB). Free memory was 51.8MB in the beginning and 330.0MB in the end (delta: -278.2MB). Peak memory consumption was 232.0MB. Max. memory is 16.1GB. [2022-11-18 20:22:51,350 INFO L158 Benchmark]: Witness Printer took 79.52ms. Allocated memory is still 612.4MB. Free memory was 330.0MB in the beginning and 326.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:22:51,360 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 104.9MB. Free memory was 74.2MB in the beginning and 74.2MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.12ms. Allocated memory is still 104.9MB. Free memory was 69.6MB in the beginning and 73.2MB in the end (delta: -3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.51ms. Allocated memory is still 104.9MB. Free memory was 73.2MB in the beginning and 71.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.03ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 69.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 706.34ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 52.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 584271.74ms. Allocated memory was 104.9MB in the beginning and 612.4MB in the end (delta: 507.5MB). Free memory was 51.8MB in the beginning and 330.0MB in the end (delta: -278.2MB). Peak memory consumption was 232.0MB. Max. memory is 16.1GB. * Witness Printer took 79.52ms. Allocated memory is still 612.4MB. Free memory was 330.0MB in the beginning and 326.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 584.2s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 57.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11498 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11498 mSDsluCounter, 12671 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4793 IncrementalHoareTripleChecker+Unchecked, 11170 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10498 IncrementalHoareTripleChecker+Invalid, 15580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 1501 mSDtfsCounter, 10498 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2608 GetRequests, 1462 SyntacticMatches, 73 SemanticMatches, 1073 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 13851 ImplicationChecksByTransitivity, 377.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=32, InterpolantAutomatonStates: 493, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 673 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 515.1s InterpolantComputationTime, 2465 NumberOfCodeBlocks, 2434 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 3198 ConstructedInterpolants, 360 QuantifiedInterpolants, 59550 SizeOfPredicates, 448 NumberOfNonLiveVariables, 7045 ConjunctsInSsa, 1066 ConjunctsInUnsatCore, 71 InterpolantComputations, 18 PerfectInterpolantSequences, 873/1634 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-18 20:22:51,580 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-18 20:22:51,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a5854c-3aac-4831-adfd-f4687d72615e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE